AAAI
2006
14 years 29 days 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...
CSCLP
2005
Springer
14 years 5 months ago
2005
Springer
CSP search algorithms are exponential in the worst-case. A trivial upper bound on the time complexity of CSP search algorithms is O∗ (dn ), where n and d are the number of variab...