RecentlyFtwo new backtracking algorithmsF dynamic backtracking (DB)and partial order dynamicbacktracking (PDB) have been presented. These algorithms have the property to be additi...
Most of complete search algorithms over Constraint Satisfaction Problems (csp) are based on Standard Backtracking. Two main enhancements of this basic scheme have been proposed : r...
A distributed concurrent search algorithm for distributed constraint satisfaction problems (DisCSPs) is presented. Concurrent search algorithms are composed of multiple search proc...
We present a way to incorporate backtracking and dynamic patching into existing debuggers, without requiring any change to their source code, the compiler or the run-time environm...
Bjorn De Sutter, Bruno De Bus, Michiel Ronsse, Koe...
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...
Michael Alekhnovich, Allan Borodin, Joshua Buresh-...