| Dynamic programming for partially observable stochastic games EA Hansen, DS Bernstein, S Zilberstein 19th National Conference on Artificial Intelligence (AAAI-04), 709-715, 2004 | 752 | 2004 |
| LAO*: A heuristic search algorithm that finds solutions with loops EA Hansen, S Zilberstein Artificial Intelligence 129 (1), 35-62, 2001 | 626 | 2001 |
| Anytime heuristic search EA Hansen, R Zhou Journal of Artificial Intelligence Research 28, 267-297, 2007 | 358 | 2007 |
| Solving POMDPs by searching in policy space EA Hansen 14th Conference on Uncertainty in Artificial Intelligence (UAI-98), 211-219, 1998 | 348* | 1998 |
| Breadth-first heuristic search R Zhou, EA Hansen Artificial Intelligence 170 (4-5), 385-408, 2006 | 347 | 2006 |
| Bounded policy iteration for decentralized POMDPs DS Bernstein, EA Hansen, S Zilberstein 19th International Joint Conference on Artificial Intelligence (IJCAI-05), 52-57, 2005 | 223 | 2005 |
| Monitoring and control of anytime algorithms: A dynamic programming approach EA Hansen, S Zilberstein Artificial Intelligence 126 (1-2), 139-157, 2001 | 191 | 2001 |
| Beam-stack search: Integrating backtracking with beam search R Zhou, EA Hansen 15th Int. Conf. on Automated Planning and Scheduling (ICAPS-05), 90-98, 2005 | 174 | 2005 |
| An improved grid-based approximation algorithm for POMDPs R Zhou, EA Hansen 17th International Joint Conf. on Artificial Intelligence (IJCAI-01), 707-716, 2001 | 167 | 2001 |
| Dynamic programming for POMDPs using a factored state representation EA Hansen, Z Feng 5th International Conference on AI Planning Systems (AIPS-2000), 130-139, 2000 | 152 | 2000 |
| Policy iteration for decentralized control of Markov decision processes DS Bernstein, C Amato, EA Hansen, S Zilberstein Journal of Artificial Intelligence Research 34 (1), 89-132, 2009 | 133 | 2009 |
| Symbolic heuristic search for factored Markov decision processes Z Feng, EA Hansen 18th National Conference on Artificial Intelligence (AAAI-02), 455-460, 2002 | 121 | 2002 |
| An improved policy iteration algorithm for partially observable MDPs EA Hansen Advances in Neural Information Processing Systems 10 (NIPS-97), 1015-1021, 1998 | 120 | 1998 |
| Multiple sequence alignment using Anytime A* R Zhou, EA Hansen 18th National Conference on Artificial Intelligence (AAAI-02), 975-977, 2002 | 112 | 2002 |
| Structured duplicate detection in external-memory graph search R Zhou, EA Hansen 19th National Conference on Artificial Intelligence (AAAI-04), 683-689, 2004 | 110 | 2004 |
| Finite-memory control of partially observable systems EA Hansen PhD Thesis, University of Massachusetts/Amherst, 1998 | 96 | 1998 |
| Monitoring the progress of anytime problem-solving EA Hansen, S Zilberstein 13th National Conference on Artificial Intelligence (AAAI-96), 1229-1234, 1996 | 81 | 1996 |
| A heuristic search approach to planning with continuous resources in stochastic domains N Meuleau, E Benazera, RI Brafman, EA Hansen, Mausam Journal of Artificial Intelligence Research 34 (1), 27-59, 2009 | 71 | 2009 |
| Synthesis of hierarchical finite-state controllers for POMDPs EA Hansen, R Zhou 13th Int. Conf. on Automated Planning and Scheduling (ICAPS-03), 113-122, 2003 | 71 | 2003 |
| Parallel structured duplicate detection R Zhou, EA Hansen 22nd AAAI Conference on Artificial Intelligence (AAAI-07), 1217-1224, 2007 | 64 | 2007 |
