Sentence examples for based on backtracking from inspiring English sources

The modeling strategy is based on backtracking of the molecular growth history in terms of the chemical events determining connectivity, transfer to polymer and recombination termination.

We propose a framework for solving CSPs based both on backtracking techniques and on the notion of tree-decomposition of the constraint networks.

An alternative MCS method has been proposed, without constructing an association graph, based on the backtracking algorithm [20, 21].

Cao et al. [22] proposed an MCS algorithm based on the backtracking VF algorithm [23, 24], with some heuristics for searching and predicting drug-like compounds.

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 optimal solution procedure, based on a backtracking Branch and Bound algorithm, is proposed to solve the multi-objective design problem and find an efficiency frontier of all efficient design configurations.

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

The algorithm is essentially based on the recursive backtracking algorithm proposed by Bron and Kerbosch [24] for maximal clique enumerations with pivoting.

Patrick O'Flynn, Ukip's head of communications and a candidate for the European parliament, said immigration was still "completely out of control" and the party was "not backtracking an inch" on its claims about Romanians and Bulgarians".[This is] based on one quarter's figures on which no statistician would base predictions on," he told the BBC's Daily Politics.

But in [27], Lin et al. pointed out that there are some problems in this method, meanwhile they proposed another minimization algorithm based on Newton's method with backtracking line search.

It is usually difficult for OpenMP programmers to use programming design techniques based on exhaustive search like backtracking, branch and bound, and dynamic programming.