1614 search results - page 20 / 323 » Breadth-First Heuristic Search |
JAIR
2006
14 years 11 months ago
2006
We present a heuristic search algorithm for solving first-order Markov Decision Processes (FOMDPs). Our approach combines first-order state abstraction that avoids evaluating stat...
102
click to vote
NIPS
2007
15 years 1 months ago
2007
Planning in partially observable environments remains a challenging problem, despite significant recent advances in offline approximation techniques. A few online methods have a...
CP
2005
Springer
15 years 5 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 ...
106
click to vote
ICAI
2004
15 years 1 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
15 years 6 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 ...