Author of the publication

Approximate Planning for Factored POMDPs using Belief State Simplification.

, and . UAI, page 409-416. Morgan Kaufmann, (1999)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Conspiracy Numbers for Min-Max Search. Artificial Intelligence, (1988)Particle-Based Belief Propagation for Structure from Motion and Dense Stereo Vision with Unknown Camera Constraints., and . RobVis, volume 4931 of Lecture Notes in Computer Science, page 16-28. Springer, (2008)World-Modeling vs. World-Axiomatizing.. LPNMR, volume 1730 of Lecture Notes in Computer Science, page 375-388. Springer, (1999)Effective Bayesian Inference for Stochastic Programs., , and . AAAI/IAAI, page 740-747. AAAI Press / The MIT Press, (1997)On the Complexity of Set-Based Analysis., and . ICFP, page 150-163. ACM, (1997)SIGPLAN Notices 32(8), August 1997.PAC Generalization Bounds for Co-training., , and . NIPS, page 375-382. MIT Press, (2001)Broad Context Language Modeling as Reading Comprehension., , , and . EACL (2), page 52-57. Association for Computational Linguistics, (2017)Case-Factor Diagrams for Structured Probabilistic Modeling., , and . UAI, page 382-391. AUAI Press, (2004)Keeping the Ball from CMUnited-99., and . RoboCup, volume 2019 of Lecture Notes in Computer Science, page 333-338. Springer, (2000)An indexed model of recursive types for foundational proof-carrying code., and . ACM Trans. Program. Lang. Syst., 23 (5): 657-683 (2001)