Sentence examples for the idea of approximating from inspiring English sources

Minghella wisely sets aside the idea of approximating cinematic sprawl onstage; he listens for each structural shift in the score and finds a simple, self-sufficient illustration of it.

The quest for a norm of a rigid-body displacement led to the idea of approximating the displacement by a rotation in a higher-dimensional space.

For distributed transducers this paper introduces the idea of approximating the width of the transducer using the underlying finite element model shape functions.

The idea of "approximating" an internal validation measure to achieve a speed-up, introduced by Giancarlo et al. and applied here to Consensus, seems to lead to significant improvements in time performance with minor losses in predictive power.

Initially, the idea of approximate reasoning using generalized modus ponens and a fuzzy implication is recalled.

This implies that the idea of approximate non-dominated sorting deserves further investigation by developing MOEAs well suited for approximate non-dominated sorting as reported in [31].

Recently, an interesting non-dominated sorting approach for many-objective optimization, called A-ENS, was reported in [31], where the idea of approximate non-dominated sorting was developed.

Using the data from a testing vehicle with VE-pump engine, we developed a controller based on the idea of approximate dynamic programming to achieve both Nitrogen Oxides and Particulate Matter optimal control.

It expands on the idea of approximate tandem repeat in which textual string (DNA sequence) is presented as a chain of eroded copies (with ∼80% identity) of the textual pattern.

The approach can be extended to solve a more general class of Hamilton Jacobi equations defined on the implicit surface, following the same idea of approximating their solutions by the solutions in the embedding Euclidean space.

The proposed approach is an extension of the simplicial-approximation approach proposed by Goyal and Ierapetritou, (Goyal and Ierapetritou, 2004a, 2004b), for solving deterministic MINLP problems and is based on the idea of closely approximating the feasible region defined by the set of constraints by an approximation of its convex hull.