Sentence examples for using a search procedure from inspiring English sources

Although less accurate than the Eikonal, Poisson method-based flow solutions are extremely close to those using a search procedure.

When explicit hydrogen atoms are used a search procedure must evaluate all hydrogen atoms, which roughly doubles the number of atoms to be evaluated.

We used a search procedure to modify the regularization parameter to obtain inferences for all sparsity levels.

Both pasteurization costs and product thermal degradation are minimized using a structured search procedure that overcomes the limitations of representing the problem as a MINLP model.

The probability of flutter is estimated using a recursive search procedure and four reliability models: First Order Reliability Method (FORM), First Order Reliability Method including the effect of unsteadiness in the aeroelastic loads (FORM-C), Second Order Reliability Method (SORM) and Weighted Average Reliability Method (WARM).

After building such a linear model using standard linear regression techniques, the linear model can be simplified by removing irrelevant variables, using a greedy search procedure that tries to improve the model's estimated error rate.

It is shown in this paper that the first worst-case-based beamforming problem can be approximately solved using SOCP and the second beamforming problem can be approximately formulated as a quasi-convex problem, which can be solved by using a bisection search procedure.

Using a stepwise search procedure in the software Phaser all four AbD1556 BMPR-IA AbD1556 BMPR-IA be identified in the asymmetricomplexes the couldal.

For oculomotor simulations (Fig. 2a), parameters of (launch-site and word length contingent) distributions of within-word fixation positions were estimated using a grid search procedure.

In the second step, informative k-mers are converted into more informative degenerate motifs using a greedy search procedure, in which sets of amino acids are tested at individual positions of the motif and changes that lead to more informative motifs are preserved.

Given a substring S of T, the SA interval of all its occurrences can be computed in O(| S|) time using a backward search procedure.