6.7k citations
- Princeton UniversityUS205 papers
- Fermi National Accelerator LaboratoryUS199 papers
- Northwestern UniversityUS199 papers
- University of RochesterUS196 papers
- University of California, RiversideUS194 papers
- Imperial College LondonGB193 papers
- RWTH Aachen UniversityDE193 papers
- University at Buffalo, State University of New YorkUS193 papers
- Rice UniversityUS192 papers
- University of KansasUS192 papers
- Florida State UniversityUS191 papers
- Northeastern UniversityUS191 papers
11 papers · 2 filters
Probabilistic Causal Reasoning
Thomas L. Dean, Keiji Kanazawa
Predicting the future is an important component of decision making. In most situations, however, there is not enough information to make accurate predictions. In this paper, we dev…
Map Learning with Indistinguishable Locations
Kenneth Basye, Thomas L. Dean
Nearly all spatial reasoning problems involve uncertainty of one sort or another. Uncertainty arises due to the inaccuracies of sensors used in measuring distances and angles. We r…
Algorithms for Irrelevance-Based Partial MAPs
Solomon Eyal Shimony
Irrelevance-based partial MAPs are useful constructs for domain-independent explanation using belief networks. We look at two definitions for such partial MAPs, and prove important…
Deliberation Scheduling for Time-Critical Sequential Decision Making
Thomas L. Dean, Leslie Pack Kaelbling, Jak Kirman +1
We describe a method for time-critical decision making involving sequential tasks and stochastic processes. The method employs several iterative refinement routines for solving dif…
On the Complexity of Solving Markov Decision Problems
Michael L. Littman, Thomas L. Dean, Leslie Pack Kaelbling
Markov decision problems (MDPs) provide the foundations for a number of problems of interest to AI researchers studying automated planning and reinforcement learning. In this paper…
Model Reduction Techniques for Computing Approximately Optimal Solutions for Markov Decision Processes
Thomas L. Dean, Robert Givan, Sonia Leach
We present a method for solving implicit (factored) Markov decision processes (MDPs) with very large state spaces. We introduce a property of state space partitions which we call e…