Sentence examples for an exact computation of from inspiring English sources

In particular, we consider the class of curves with Pythagorean structures, because they provide an exact computation of fundamental geometric quantities.

But, an exact computation of fitness may not be really necessary as long as a proper rank is approximately preserved in the evolution's scheme of the survival of the fittest.

Both algorithms assume only local communication between nodes in immediate neighborhoods and, to achieve an exact computation of the global weights, require only a finite number of iterative message exchanges between nodes in the time interval between two consecutive sensor measurements.

Given the need for an exact computation of macro-state transition probabilities, we will now evaluate the impact of a local flooding scheme compared with the standard global flooding approach.

An exact computation of water saturation using Archie's formula is based on an accurate values of Archie's parameters a, m and n.

Using ideas and results from polynomial time approximation and exact computation we design approximation algorithms for several NP-hard combinatorial problems achieving ratios that cannot be achieved in polynomial time (unless a very unlikely complexity conjecture is confirmed) with worst-case complexity much lower (though super-polynomial) than that of an exact computation.

We design approximation algorithms for min set cover achieving ratios that cannot be achieved in polynomial time (unless problems in NP could be solved by slightly super-polynomial algorithms) with worst-case complexity much lower (though super-polynomial) than those of an exact computation.

A fast and exact computation of harmonic references is more than crucial for any active filter control strategy, especially during the transient time and frequency domains.

However, VCG relies on exact computation of an optimal allocation of resources, a problem which is often computationally intractable, and VCG that uses an approximate allocation algorithm no longer guarantees truthful revelation of preferences.

In 1918, Hardy and Ramanujan studied the partition function P(n) extensively and gave a non-convergent asymptotic series that permits exact computation of the number of partitions of an integer.

Nevertheless, we could give an integer linear program for the exact computation of the distance that is fast enough to be applied to realistic problem instances.