400 search results - page 9 / 80 » Backtracking |
CSMR
2008
IEEE
14 years 4 months ago
2008
IEEE
Failing integration builds are show stoppers. Development activity is stalled because developers have to wait with integrating new changes until the problem is fixed and a succes...
COCO
2005
Springer
14 years 3 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...
SECON
2010
IEEE
13 years 7 months ago
2010
IEEE
Existing solutions to carrier-based sensor placement by a single robot, in a bounded unknown region of interest (ROI), do not guarantee full area coverage and/or do not terminate. ...
IJCAI
2007
13 years 11 months ago
2007
Hypertree decomposition has been shown to be the most general CSP decomposition method. However, so far the exact methods are not able to find optimal hypertree decompositions of...
AAAI
2006
13 years 11 months ago
2006
Many planning and design problems can be characterized as optimal search over a constrained network of conditional choices with preferences. To draw upon the advanced methods of c...