9730 search results - page 1 / 1946 » Relating models of backtracking |
ICSE
2009
IEEE-ACM
13 years 3 months ago
2009
IEEE-ACM
Backtracking is necessary when design alternatives are explored or dead ends are reached. Unfortunately, current approaches support chronological backtracking only (undo or versio...
ICFP
2004
ACM
14 years 5 months ago
2004
ACM
Past attempts to relate two well-known models of backtracking computation have met with only limited success. We relate these two models using logical relations. We accommodate hi...
CP
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Most CSP algorithms are based on refinements and extensions of backtracking, and employ one of two simple “branching schemes”: 2-way branching or d-way branching, fo...
AAAI
2008
13 years 7 months ago
2008
Previous studies have demonstrated that encoding a Bayesian network into a SAT-CNF formula and then performing weighted model counting using a backtracking search algorithm can be...
COCO
2005
Springer
13 years 10 months ago
2005
Springer
We propose a model called priority branching trees (pBT ) for backtracking and dynamic programming algorithms. Our model generalizes both the priority model of Borodin, Nielson an...