Rina Dechter and Daniel Frost. Backjump-based backtracking for constraint satisfaction problems. Artificial Intelligence, 136(2):147--188, 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Limited Assignment Number Search Algorithm - Vermirovsky, Rudova (Correct)
....the space by following carefully tuned heuristics which guide the search toward the regions of space which are likely to contain solutions. For many problems, this may lead directly to a solution. There is a variety of search algorithms available, e.g. limited discrepancy search [3] backjumping [2], or local search with constraint propagation [4] Our intent is devoted to the problems where it is di#cult or impossible to find a solution. The heuristics may not be good enough or and the problem may be over constrained. We propose a linear time iterative search algorithm which can be used in ....
....201 01 0942 and by Purdue University. We would also like to thank to the Supercomputer Center Brno where the experiments with random problems were accomplished. 2 Description of LAN Search The limited assignment number (LAN) search algorithm is based on backtracking with constraint propagation [2]. The aim is to always find a solution (though not necessarily a complete one) of a constraint satisfaction problem [6] The object of a constraint satisfaction problem is to find an assignment of values to given variables from domains which satisfy the given conditions (con straints) Such a ....
Rina Dechter and Daniel Frost. Backjump-based backtracking for constraint satisfaction problems. Artificial Intelligence, 136(2):147--188, 2002.
Minimal Perturbation Problem in Course Timetabling - Müller, Rudova (Correct)
No context found.
Rina Dechter and Daniel Frost. Backjump-based backtracking for constraint satisfaction problems. Artificial Intelligence, 136(2):147--188, 2002.
Combining Constraint Programming and Simulated Annealing on.. - Duong, Lam (2004) (Correct)
No context found.
R. Dechter, and D. Frost, "Backjump-based Backtracking for Constraint Satisfaction Problems", Artificial Intelligence, vol. 136, 147-188, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC