5831 search results - page 4 / 1167 » Distributed Dynamic Backtracking |
IEEEPACT
2000
IEEE
14 years 28 days ago
2000
IEEE
REX
1993
14 years 19 days ago
1993
CP
2000
Springer
14 years 27 days ago
2000
Springer
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...
AADEBUG
2005
Springer
13 years 10 months ago
2005
Springer
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...
COCO
2005
Springer
14 years 2 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...