810 search results - page 132 / 162 » Solving Time-Dependent Planning Problems |
AUSAI
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Quantified Boolean formulas (QBFs) play an important role in artificial intelligence subjects, specially in planning, knowledge representation and reasoning [20]. In th...
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
Pattern Databases were a major breakthrough in heuristic search by solving hard combinatorial problems various orders of magnitude faster than state-of-the-art techniques at that ...
AGI
2008
13 years 9 months ago
2008
Inhabiting the complex and dynamic environments of modern computer games with autonomous agents capable of intelligent timely behaviour is a significant research challenge. We illu...
C3S2E
2010
ACM
13 years 9 months ago
2010
ACM
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
JAIR
2006
13 years 7 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...