729 search results - page 127 / 146 » Reflections on Agent Beliefs |
AAAI
2006
15 years 19 days ago
2006
Even under polynomial restrictions on plan length, conformant planning remains a very hard computational problem as plan verification itself can take exponential time. This heavy ...
104
click to vote
AAAI
2006
15 years 19 days ago
2006
Reasoning with both probabilistic and deterministic dependencies is important for many real-world problems, and in particular for the emerging field of statistical relational lear...
AAAI
2000
15 years 18 days ago
2000
Transpose-and-Cache Branch-and-Bound (TCBB) has shown promise in solving large single machine quadratic penalty problems. There exist other classes of single machine job sequencin...
AAAI
1997
15 years 18 days ago
1997
Partially observable Markov decision processes (POMDPs) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect ...
AAAI
1996
15 years 17 days ago
1996
Truth maintenance systems provide caches of beliefs and inferences that support explanations and search. Traditionally, the cost of using a TMS is monotonic growth in the size of ...