Sentence examples for minimizing a global from inspiring English sources

The empirical parameter was evaluated by minimizing a global objective function.

Anisotropy is used to estimate W P, H P, W H and H H by minimizing a global objective function that depends on a β-divergence cost, a percussive cost and a harmonic cost.

On the other hand, existing algorithms for edge bundling have a different scope: network bundles aim at rendering aesthetically pleasing and topologically compact drawings; yet, the existing algorithms do not necessarily aim at minimizing a global distance metric.

By observing these figures, it is possible to confirm the following facts: Regardless of the configuration of the polygonal maps and the structure of bipartite graphs, it is possible to converge to the bundled routes minimizing a global distance metric within 1000 function evaluations and 15 independent runs.

This raises the problem of quantizer design optimized for distributed estimation systems where the goal is to design independently operating quantizers that minimize a global metric such as the estimation error (a function of all sensor readings).

EC methods use "populations" of candidate solutions that are recombined, mutated and reproduce using a form of trial and error that attempts to optimally maximize (or minimize) a global fitness (or cost) function.

In this paper we tackle the route bundling problem which consists of compounding multiple routes in a way that intermediate points minimize a global distance metric of multiple origin destinations pairs.

The pressure drop and heat transfer characteristics are examined, and an optimization is carried out to minimize a global objective function consisting of the correlation between the Nusselt number and the friction factor.

Route bundling implies compounding multiple routes in a way that anchoring points at intermediate locations minimize a global distance metric to obtain a tree-like structure where the roots of the tree (anchoring points) serve as coordinating locus for the joint transport of information, goods and people.

Typically, these algorithms solve for the disparity map by minimizing a pre-defined global cost function.

The sink's gradient is set to 0, and the others' gradients are assigned to minimize a certain global objective function.