1615 search results - page 17 / 323 » Pathology in heuristic search |
CP
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. The heavy-tailed phenomenon that characterises the runtime distributions of backtrack search procedures has received considerable attention over the past few years. Some ...
ICAI
2004
13 years 10 months ago
2004
In the age of electronic commerce, with low-cost information access, it has been recognized that a bundle search in a combinatorial trade is very valuable for buyers. Optimal trav...
CP
2007
Springer
14 years 2 months ago
2007
Springer
Constraints have played a central role in cp because they capture key substructures of a problem and efficiently exploit them to boost inference. This paper intends to do the same ...
CSCLP
2005
Springer
14 years 2 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...
UAI
2004
13 years 10 months ago
2004
We present a novel POMDP planning algorithm called heuristic search value iteration (HSVI). HSVI is an anytime algorithm that returns a policy and a provable bound on its regret w...