Sentence examples for far less computation from inspiring English sources

Such a system would probably require far less computation than current methods, thereby helping to conserve a rover's precious battery power, Kleinfeld says.

As Table 1 shows, the energy-based methods (ODF E and ODFELP) require far less computation than any of the others.

The resulting models were compared with ones generated by more traditional means, and generally they appear to be as good or better, while requiring far less computation to create.

Buxton describes the implications of such a development in his interview with Beecroft, saying "It takes a long time to generate sounds by computer using the traditional digital synthesis techniques, and with Gabura's system, since it took far less computation to control some oscillators, he could generate the control information right away, so you could hear the results of your system".

The results of these analyses agree with results from quantitative simulations of the task reported in previous publications and provide simple indications of the memory demands of the tasks which can require far less computation than a full simulation of the task.

We, therefore, have to resort to a sophisticated optimization method, which requires far less computation.

Our mixture method produces more accurate ancestral genomes compared with the maximum likelihood method while the computation time is far less than that of the parsimony-based direct optimization methods.

Experiments show that our mixture method produces more accurate ancestral genomes than the maximum likelihood method while the computation time is far less than that of pure median method.

The computational complexity of our method is O(nm) and its computation time is by far less than that of SVMs methods.

For the periodic flow, the present boundary condition still performed best in comparison with conventional far boundary conditions while the Neumann condition, which had comparable accuracy with less computation time for the steady flow, failed altogether to achieve any convergence.

Although recent studies use FPGA technology to tackle the memory wall problem of graph computation by adopting a massively multi-threaded architecture, the performance is still far less than optimal memory performance due to the long memory access latency.