Sciweavers

729 search results - page 127 / 146
» Reflections on Agent Beliefs
Sort
View
AAAI
2006
14 years 11 months ago
Compiling Uncertainty Away: Solving Conformant Planning Problems using a Classical Planner (Sometimes)
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 ...
Héctor Palacios, Hector Geffner
AAAI
2006
14 years 11 months ago
Sound and Efficient Inference with Probabilistic and Deterministic Dependencies
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...
Hoifung Poon, Pedro Domingos
AAAI
2000
14 years 11 months ago
TCBB Scheme: Applications to Single Machine Job Sequencing Problems
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...
Sakib A. Mondal, Anup K. Sen
78
Voted
AAAI
1997
14 years 11 months ago
Incremental Methods for Computing Bounds in Partially Observable Markov Decision Processes
Partially observable Markov decision processes (POMDPs) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect ...
Milos Hauskrecht
AAAI
1996
14 years 11 months ago
Scaling up Logic-Based Truth Maintenance Systems via Fact Garbage Collection
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 ...
John O. Everett, Kenneth D. Forbus