| 2013 | ||
|---|---|---|
| i6 | ||
| 2012 | ||
| c48 | Arindam Khaled, Changhe Yuan, Eric A. Hansen: Solving Limited Memory Influence Diagrams Using Branch-and-Bound Search. ISAIM 2012 | |
| i5 | Eric A. Hansen: Suboptimality Bounds for Stochastic Shortest Path Problems. CoRR abs/1202.3729 (2012) | |
| i4 | Brandon M. Malone, Changhe Yuan, Eric A. Hansen, Susan Bridges: Improving the Scalability of . CoRR abs/1202.3744 (2012) | |
| i3 | Changhe Yuan, XiaoJian Wu, Eric A. Hansen: Solving Multistage Influence Diagrams using Branch-and-Bound Search. CoRR abs/1203.3531 (2012) | |
| i2 | ||
| i1 | Zhengzhu Feng, Eric A. Hansen, Shlomo Zilberstein: Symbolic Generalization for On-line Planning. CoRR abs/1212.2459 (2012) | |
| 2011 | ||
| c47 | Brandon M. Malone, Changhe Yuan, Eric A. Hansen: Memory-Efficient Dynamic Programming for Learning Optimal Bayesian Networks. AAAI 2011 | |
| c46 | Rong Zhou, Eric A. Hansen: Dynamic State-Space Partitioning in External-Memory Graph Search. ICAPS 2011 | |
| c45 | Sathishkumar Samiappan, Saurabh Prasad, Lori M. Bruce, Eric A. Hansen: Branch and bound based feature elimination for support vector machine based classification of hyperspectral images. IGARSS 2011: 2523-2526 | |
| c44 | ||
| c43 | Brandon M. Malone, Changhe Yuan, Eric A. Hansen, Susan Bridges: Improving the Scalability of Optimal Bayesian Network Learning with External-Memory Frontier Breadth-First Branch and Bound Search. UAI 2011: 479-488 | |
| 2010 | ||
| c42 | Naveen Parihar, Ralf Schlüter, David Rybach, Eric A. Hansen: Parallel lexical-tree based LVCSR on multi-core processors. INTERSPEECH 2010: 1485-1488 | |
| c41 | Rong Zhou, Tim Schmidt, Eric A. Hansen, Minh Binh Do, Serdar Uckun: Edge Partitioning in Parallel Structured Duplicate Detection. SOCS 2010 | |
| c40 | Changhe Yuan, XiaoJian Wu, Eric A. Hansen: Solving Multistage Influence Diagrams using Branch-and-Bound Search. UAI 2010: 691-700 | |
| 2009 | ||
| j7 | Nicolas Meuleau, Emmanuel Benazera, Ronen I. Brafman, Eric A. Hansen, Mausam: A Heuristic Search Approach to Planning with Continuous Resources in Stochastic Domains. J. Artif. Intell. Res. (JAIR) 34: 27-59 (2009) | |
| j6 | Daniel S. Bernstein, Christopher Amato, Eric A. Hansen, Shlomo Zilberstein: Policy Iteration for Decentralized Control of Markov Decision Processes. J. Artif. Intell. Res. (JAIR) 34: 89-132 (2009) | |
| c39 | Rong Zhou, Eric A. Hansen: Combining Breadth-First and Depth-First Strategies in Searching for Treewidth. IJCAI 2009: 640-645 | |
| c38 | Changhe Yuan, Eric A. Hansen: Efficient Computation of Jointree Bounds for Systematic MAP Search. IJCAI 2009: 1982-1989 | |
| c37 | Naveen Parihar, Ralf Schlüter, David Rybach, Eric A. Hansen: Parallel fast likelihood computation for LVCSR using mixture decomposition. INTERSPEECH 2009: 3047-3050 | |
| 2008 | ||
| c36 | Peter Lamborn, Eric A. Hansen: Layered Duplicate Detection in External-Memory Model Checking. SPIN 2008: 160-175 | |
| c35 | ||
| e1 | Jussi Rintanen, Bernhard Nebel, J. Christopher Beck, Eric A. Hansen (Eds.): Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling, ICAPS 2008, Sydney, Australia, September 14-18, 2008. AAAI 2008, isbn 978-1-57735-386-7 | |
| 2007 | ||
| j5 | Eric A. Hansen, Rong Zhou: Anytime Heuristic Search. J. Artif. Intell. Res. (JAIR) 28: 267-297 (2007) | |
| c34 | ||
| c33 | ||
| c32 | Peng Dai, Eric A. Hansen: Prioritizing Bellman Backups without a Priority Queue. ICAPS 2007: 113-119 | |
| c31 | ||
| 2006 | ||
| j4 | ||
| c30 | ||
| c29 | ||
| c28 | Rune M. Jensen, Eric A. Hansen, Simon Richards, Rong Zhou: Memory-Efficient Symbolic Heuristic Search. ICAPS 2006: 304-313 | |
| 2005 | ||
| c27 | German Florez-Larrahondo, Susan Bridges, Eric A. Hansen: Incremental Estimation of Discrete Hidden Markov Models Based on a New Backward Procedure. AAAI 2005: 758-763 | |
| c26 | ||
| c25 | Rong Zhou, Eric A. Hansen: Beam-Stack Search: Integrating Backtracking with Beam Search. ICAPS 2005: 90-98 | |
| c24 | Mausam, Emmanuel Benazera, Ronen I. Brafman, Nicolas Meuleau, Eric A. Hansen: Planning with Continuous Resources in Stochastic Domains. IJCAI 2005: 1244-1251 | |
| c23 | Daniel S. Bernstein, Eric A. Hansen, Shlomo Zilberstein: Bounded Policy Iteration for Decentralized POMDPs. IJCAI 2005: 1287-1292 | |
| 2004 | ||
| c22 | ||
| c21 | ||
| c20 | Eric A. Hansen, Daniel S. Bernstein, Shlomo Zilberstein: Dynamic Programming for Partially Observable Stochastic Games. AAAI 2004: 709-715 | |
| c19 | ||
| c18 | Rong Zhou, Eric A. Hansen: K-Group A for Multiple Sequence Alignment with Quasi-Natural Gap Costs. ICTAI 2004: 688-695 | |
| c17 | ||
| 2003 | ||
| c16 | Eric A. Hansen, Rong Zhou: Synthesis of Hierarchical Finite-State Controllers for POMDPs. ICAPS 2003: 113-122 | |
| c15 | Rong Zhou, Eric A. Hansen: Sweep A*: Space-Efficient Heuristic Search in Partially Ordered Graphs. ICTAI 2003: 427-434 | |
| c14 | ||
| c13 | Zhengzhu Feng, Eric A. Hansen, Shlomo Zilberstein: Symbolic Generalization for On-line Planning. UAI 2003: 209-216 | |
| 2002 | ||
| c12 | Zhengzhu Feng, Eric A. Hansen: Symbolic Heuristic Search for Factored Markov Decision Processes. AAAI/IAAI 2002: 455-460 | |
| c11 | ||
| c10 | ||
| c9 | Eric A. Hansen, Rong Zhou, Zhengzhu Feng: Symbolic Heuristic Search Using Decision Diagrams. SARA 2002: 83-98 | |
| 2001 | ||
| j3 | Eric A. Hansen, Shlomo Zilberstein: Monitoring and control of anytime algorithms: A dynamic programming approach. Artif. Intell. 126(1-2): 139-157 (2001) | |
| j2 | Eric A. Hansen, Shlomo Zilberstein: LAO*: A heuristic search algorithm that finds solutions with loops. Artif. Intell. 129(1-2): 35-62 (2001) | |
| c8 | Rong Zhou, Eric A. Hansen: An Improved Grid-Based Approximation Algorithm for POMDPs. IJCAI 2001: 707-716 | |
| 2000 | ||
| c7 | Eric A. Hansen, Zhengzhu Feng: Dynamic Programming for POMDPs Using a Factored State Representation. AIPS 2000: 130-139 | |
| 1998 | ||
| c6 | Eric A. Hansen, Shlomo Zilberstein: Heuristic Search in Cyclic AND/OR Graphs. AAAI/IAAI 1998: 412-418 | |
| c5 | ||
| 1997 | ||
| c4 | ||
| 1996 | ||
| j1 | Eric A. Hansen, Shlomo Zilberstein: Monitoring Anytime Algorithms. SIGART Bulletin 7(2): 28-33 (1996) | |
| c3 | Eric A. Hansen, Shlomo Zilberstein: Monitoring the Progress of Anytime Problem-Solving. AAAI/IAAI, Vol. 2 1996: 1229-1234 | |
| c2 | Eric A. Hansen, Andrew G. Barto, Shlomo Zilberstein: Reinforcement Learning for Mixed Open-loop and Closed-loop Control. NIPS 1996: 1026-1032 | |
| 1994 | ||
| c1 | ||
Colors in the list of coauthors
Last update Thu May 23 03:22:49 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page