Sentence examples for backtracking method from inspiring English sources

One is the backtracking method, which is employed for our design.

Nonlinear steady-state optimization based on homotopy-based backtracking method is performed offline to obtain optimal operating points at various load demands.

In addition, we propose a modified shortest path algorithm based on the backtracking method to prevent deadlocks, which is critical for the correct operation of NoCs.

The principle of acceleration is for provide to the inexact Newton backtracking method a better initial guess, for the current time step, than the conventional choice from the previous time step.

The other entries of d k are set to 0. After determining the search direction, the next iteration point is derived by the backtracking method.

We screened and sequenced FLT3 mutations (point mutations and internal tandem duplications, ITDs) among 517 childhood leukemia patients, and assessed whether these mutations occurred before or after birth using sensitive "backtracking" methods.

To avoid combinatorial explosion in the case of highly symmetrical structures, the algorithim uses two approaches: (1) elimination of non-stereogenic elements and (2) a backtrack method that prunes the search tree [40].

This library allows the expression of most of the partial, i.e. nonsystematic backtracking, search methods, and also a specific class of hybrid local/global search methods called large neighborhood search, which are very naturally suited to CP. Variants of these methods are easy to implement with the ToOLS primitives.

All spanning trees of this simplified graph are found with a program using backtracking and a method for detecting bridges based on depth-first search.

By applying this method (backtracking, memetic or greedy algorithm depending on the number of vertices) recursively, we have at each step a graph as input, and the two subgraphs induced by each of the sets of the vertex partition as output; stopping when we arrive to a graph with just one vertex, we generate a hierarchical clustering in a top-down fashion.

Initially, the full set of features was provided and greedy hill-climbing approach augmented with a backtracking facility (BestFirst method in Weka: Select Attributes) was used for feature search.