# backjump造句

- The backjumping algorithm by Gaschnig does a backjump only in leaf dead ends.
- The efficiency of a backjumping algorithm depends on how high it is able to backjump.
- As a result, the algorithm can backjump to the highest index in this set.
- In other words, it allows for a backjump only at leaf nodes in the search tree.
- If no solution extends this assignment, the previous algorithm always backtracks : no backjump is done in this case.
- In other words, a backjump indicates that the visit of a region of the search tree had been a mistake.
- The fact that nodes skipped by backjumping can be ignored when considering a further backjump can be exploited by the following algorithm.
- In order to further backjump, the algorithm has to take into account that the impossibility of finding solutions is due to these dead ends.
- This part of the search tree can therefore be ignored when considering a possible backjump from x _ l or from one of its ancestors.
- Indeed, the backjump indicates that the nodes between x _ l and x _ m are irrelevant to the subtree rooted at x _ m.
- It's difficult to see backjump in a sentence. 用backjump造句挺難的
- The second simplification is that nodes in the subtree of x _ l that have been skipped by a backjump can be ignored while looking for a backjump for x _ l.
- The second simplification is that nodes in the subtree of x _ l that have been skipped by a backjump can be ignored while looking for a backjump for x _ l.
- More precisely, all nodes skipped by a backjump from node x _ m up to node x _ l are irrelevant to the subtree rooted at x _ m, and also irrelevant are their other subtrees.
- In other words, when all values of x _ { k + 1 } have been tried, the algorithm can backjump to a variable x _ i provided that the current truth evaluation of x _ 1, \ ldots, x _ i is inconsistent with all the truth evaluations of x _ { k + 1 }, x _ { k + 2 }, . . . in the leaf nodes that are descendants of the node x _ { k + 1 }.