Sentence examples for situations computation from inspiring English sources

For the spatial interpolation of environmental variables in routine and emergency situations, computation time and interpolation accuracy are important criteria to evaluate and compare algorithms.

We consider the following situations: computation of Eƒ Xt) by a Monte-Carlo method (for example, computation of moments of the solution); integration of ƒ with respect to the invariant probability law of (Xt) (when this process is ergodic); or of the upper Lyapunov exponent, by simulating a single trajectory.

In general situations, the computation of these importance weights involve the unknown transition density of the process (1).

These will enable him/her to have a deeper insight into its character in the background of our aesthetic sense and its extraordinary tendency to pop up in diverse situations through quick computation.

The use of the adjustment algorithm in addition to a search over a coarse grid of candidate points is especially recommended in situations where the computation time has to be kept within reasonable limits.

Based on the results presented previously, we suggest that tuning of the regularization can be avoided in certain situations, saving considerable computation time.

In such situations, the non-analytic computation is merely a one-dimensional quadrature, which can be computed by standard numerical techniques.

Examples of this situation, drawn from computational geometry, numerical parallel computation, VLSI theory, and computational biology, will be reviewed and examined in detail.

Though decay heat removal through natural convection is achievable in a pool type SFR, demonstration of design solutions conceived in the reactor and performance of diverse systems under all operating conditions, especially over prolonged station blackout situations needs advanced CFD computations and should be validated by relatively large scale simulated experiments.

Three examples of such situations are: (1) when computations have an exponential or factorial (BLAST all against all) increase in time as a factor of the sequence count, (2) when computation time increases exponentially as a factor of sequence length e.g. RNA or protein folding [ 21- 23] or (3) those in which an extensive literature search is expected to follow computations.

Unfortunately, there is neither a universal notion of trust that is applicable to all domains nor a clear explication of its semantics or computation in many situations.