72 search results - page 8 / 15 » Fast Planning by Search in Domain Transition Graph |
ICPP
2006
IEEE
15 years 5 months ago
2006
IEEE
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
AIPS
2006
15 years 1 months ago
2006
We present a new algorithm for probabilistic planning with no observability. Our algorithm, called Probabilistic-FF, extends the heuristic forward-search machinery of Conformant-F...
124
Voted
AAAI
2008
15 years 1 months ago
2008
Traditional artificial intelligence techniques do not perform well in applications such as real-time strategy games because of the extensive search spaces which need to be explore...
118
click to vote
NIPS
2004
15 years 1 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
61
Voted
ICTAI
2006
IEEE
15 years 5 months ago
2006
IEEE
This paper shows a way to speed up search by using an encoding at bit level to model a particular domain. A bitboard is an unsigned integer whose bits have been given an interpret...