loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'04)
Backjump-Based Techniques versus Conflict-Directed Heuristics
Boca Raton, Florida
November 15-November 17
ISBN: 0-7695-2236-X
Christophe Lecoutre, CRIL - CNRS FRE 2499
Frédéric Boussemart, CRIL - CNRS FRE 2499
Fred Hemery, CRIL - CNRS FRE 2499
In this paper, we present a general algorithm which gives an uniform view of several state-of-the-art systematic back-tracking search algorithms for solving both binary and non-binary CSP instances. More precisely, this algorithm integrates the most usual or/and sophisticated look-back and look-ahead schemes. By means of this algorithm, our purpose is then to study the interest of backjump-based techniques with respect to conflict-directed variable ordering heuristics.
Citation:
Christophe Lecoutre, Frédéric Boussemart, Fred Hemery, "Backjump-Based Techniques versus Conflict-Directed Heuristics," ictai, pp.549-557, 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.