| 2012 | ||
|---|---|---|
| 59 | Arindam Khaled, Changhe Yuan, Eric A. Hansen: Solving Limited Memory Influence Diagrams Using Branch-and-Bound Search. ISAIM 2012 | |
| 58 | Eric A. Hansen: Suboptimality Bounds for Stochastic Shortest Path Problems CoRR abs/1202.3729: (2012) | |
| 57 | Brandon M. Malone, Changhe Yuan, Eric A. Hansen, Susan Bridges: Improving the Scalability of CoRR abs/1202.3744: (2012) | |
| 56 | Changhe Yuan, XiaoJian Wu, Eric A. Hansen: Solving Multistage Influence Diagrams using Branch-and-Bound Search CoRR abs/1203.3531: (2012) | |
| 2011 | ||
| 55 | Brandon M. Malone, Changhe Yuan, Eric A. Hansen: Memory-Efficient Dynamic Programming for Learning Optimal Bayesian Networks. AAAI 2011 | |
| 54 | Rong Zhou, Eric A. Hansen: Dynamic State-Space Partitioning in External-Memory Graph Search. ICAPS 2011 | |
| 53 | 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 | |
| 52 | Eric A. Hansen: Suboptimality Bounds for Stochastic Shortest Path Problems. UAI 2011: 301-310 | |
| 51 | 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 | ||
| 50 | Naveen Parihar, Ralf Schlüter, David Rybach, Eric A. Hansen: Parallel lexical-tree based LVCSR on multi-core processors. INTERSPEECH 2010: 1485-1488 | |
| 49 | Rong Zhou, Tim Schmidt, Eric A. Hansen, Minh Binh Do, Serdar Uckun: Edge Partitioning in Parallel Structured Duplicate Detection. SOCS 2010 | |
| 48 | Changhe Yuan, XiaoJian Wu, Eric A. Hansen: Solving Multistage Influence Diagrams using Branch-and-Bound Search. UAI 2010: 691-700 | |
| 2009 | ||
| 47 | Changhe Yuan, Eric A. Hansen: Efficient Computation of Jointree Bounds for Systematic MAP Search. IJCAI 2009: 1982-1989 | |
| 46 | Rong Zhou, Eric A. Hansen: Combining Breadth-First and Depth-First Strategies in Searching for Treewidth. IJCAI 2009: 640-645 | |
| 45 | Naveen Parihar, Ralf Schlüter, David Rybach, Eric A. Hansen: Parallel fast likelihood computation for LVCSR using mixture decomposition. INTERSPEECH 2009: 3047-3050 | |
| 44 | 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) | |
| 43 | 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) | |
| 2008 | ||
| 42 | Jussi Rintanen, Bernhard Nebel, J. Christopher Beck, Eric A. Hansen: Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling, ICAPS 2008, Sydney, Australia, September 14-18, 2008 AAAI 2008 | |
| 41 | Peter Lamborn, Eric A. Hansen: Layered Duplicate Detection in External-Memory Model Checking. SPIN 2008: 160-175 | |
| 40 | Eric A. Hansen: Sparse Stochastic Finite-State Controllers for POMDPs. UAI 2008: 256-263 | |
| 2007 | ||
| 39 | Rong Zhou, Eric A. Hansen: Parallel Structured Duplicate Detection. AAAI 2007: 1217- | |
| 38 | Eric A. Hansen: Indefinite-Horizon POMDPs with Action-Based Termination. AAAI 2007: 1237-1242 | |
| 37 | Peng Dai, Eric A. Hansen: Prioritizing Bellman Backups without a Priority Queue. ICAPS 2007: 113-119 | |
| 36 | Rong Zhou, Eric A. Hansen: Edge Partitioning in External-Memory Graph Search. IJCAI 2007: 2410-2417 | |
| 35 | Eric A. Hansen, Rong Zhou: Anytime Heuristic Search. J. Artif. Intell. Res. (JAIR) 28: 267-297 (2007) | |
| 2006 | ||
| 34 | Rong Zhou, Eric A. Hansen: Domain-Independent Structured Duplicate Detection. AAAI 2006: 1082-1088 | |
| 33 | Rong Zhou, Eric A. Hansen: A Breadth-First Approach to Memory-Efficient Graph Search. AAAI 2006: 1695-1699 | |
| 32 | Rune M. Jensen, Eric A. Hansen, Simon Richards, Rong Zhou: Memory-Efficient Symbolic Heuristic Search. ICAPS 2006: 304-313 | |
| 31 | Rong Zhou, Eric A. Hansen: Breadth-first heuristic search. Artif. Intell. 170(4-5): 385-408 (2006) | |
| 2005 | ||
| 30 | Rong Zhou, Eric A. Hansen: External-Memory Pattern Databases Using Structured Duplicate Detection. AAAI 2005: 1398-1405 | |
| 29 | 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 | |
| 28 | Rong Zhou, Eric A. Hansen: Beam-Stack Search: Integrating Backtracking with Beam Search. ICAPS 2005: 90-98 | |
| 27 | Mausam, Emmanuel Benazera, Ronen I. Brafman, Nicolas Meuleau, Eric A. Hansen: Planning with Continuous Resources in Stochastic Domains. IJCAI 2005: 1244-1251 | |
| 26 | Daniel S. Bernstein, Eric A. Hansen, Shlomo Zilberstein: Bounded Policy Iteration for Decentralized POMDPs. IJCAI 2005: 1287-1292 | |
| 2004 | ||
| 25 | Rong Zhou, Eric A. Hansen: Space-Efficient Memory-Based Heuristics. AAAI 2004: 677-682 | |
| 24 | Rong Zhou, Eric A. Hansen: Structured Duplicate Detection in External-Memory Graph Search. AAAI 2004: 683-689 | |
| 23 | Eric A. Hansen, Daniel S. Bernstein, Shlomo Zilberstein: Dynamic Programming for Partially Observable Stochastic Games. AAAI 2004: 709-715 | |
| 22 | Rong Zhou, Eric A. Hansen: Breadth-First Heuristic Search. ICAPS 2004: 92-100 | |
| 21 | Rong Zhou, Eric A. Hansen: K-Group A for Multiple Sequence Alignment with Quasi-Natural Gap Costs. ICTAI 2004: 688-695 | |
| 20 | Rong Zhou, Eric A. Hansen: Breadth-First Heuristic Search. KR 2004: 701-709 | |
| 2003 | ||
| 19 | Eric A. Hansen, Rong Zhou: Synthesis of Hierarchical Finite-State Controllers for POMDPs. ICAPS 2003: 113-122 | |
| 18 | Rong Zhou, Eric A. Hansen: Sweep A*: Space-Efficient Heuristic Search in Partially Ordered Graphs. ICTAI 2003: 427-434 | |
| 17 | Rong Zhou, Eric A. Hansen: Sparse-Memory Graph Search. IJCAI 2003: 1259-1268 | |
| 16 | Zhengzhu Feng, Eric A. Hansen, Shlomo Zilberstein: Symbolic Generalization for On-line Planning. UAI 2003: 209-216 | |
| 2002 | ||
| 15 | Zhengzhu Feng, Eric A. Hansen: Symbolic Heuristic Search for Factored Markov Decision Processes. AAAI/IAAI 2002: 455-460 | |
| 14 | Rong Zhou, Eric A. Hansen: Multiple Sequence Alignment Using Anytime A*. AAAI/IAAI 2002: 975- | |
| 13 | Rong Zhou, Eric A. Hansen: Memory-Bounded A* Graph Search. FLAIRS Conference 2002: 203-209 | |
| 12 | Eric A. Hansen, Rong Zhou, Zhengzhu Feng: Symbolic Heuristic Search Using Decision Diagrams. SARA 2002: 83-98 | |
| 2001 | ||
| 11 | Rong Zhou, Eric A. Hansen: An Improved Grid-Based Approximation Algorithm for POMDPs. IJCAI 2001: 707-716 | |
| 10 | Eric A. Hansen, Shlomo Zilberstein: Monitoring and control of anytime algorithms: A dynamic programming approach. Artif. Intell. 126(1-2): 139-157 (2001) | |
| 9 | Eric A. Hansen, Shlomo Zilberstein: LAO*: A heuristic search algorithm that finds solutions with loops. Artif. Intell. 129(1-2): 35-62 (2001) | |
| 2000 | ||
| 8 | Eric A. Hansen, Zhengzhu Feng: Dynamic Programming for POMDPs Using a Factored State Representation. AIPS 2000: 130-139 | |
| 1998 | ||
| 7 | Eric A. Hansen, Shlomo Zilberstein: Heuristic Search in Cyclic AND/OR Graphs. AAAI/IAAI 1998: 412-418 | |
| 6 | Eric A. Hansen: Solving POMDPs by Searching in Policy Space. UAI 1998: 211-219 | |
| 1997 | ||
| 5 | Eric A. Hansen: An Improved Policy Iteration Algorithm for Partially Observable MDPs. NIPS 1997 | |
| 1996 | ||
| 4 | Eric A. Hansen, Shlomo Zilberstein: Monitoring the Progress of Anytime Problem-Solving. AAAI/IAAI, Vol. 2 1996: 1229-1234 | |
| 3 | Eric A. Hansen, Andrew G. Barto, Shlomo Zilberstein: Reinforcement Learning for Mixed Open-loop and Closed-loop Control. NIPS 1996: 1026-1032 | |
| 2 | Eric A. Hansen, Shlomo Zilberstein: Monitoring Anytime Algorithms. SIGART Bulletin 7(2): 28-33 (1996) | |
| 1994 | ||
| 1 | Eric A. Hansen: Cost-Effective Sensing during Plan Execution. AAAI 1994: 1029-1035 | |
Colors in the list of coauthors
Last update Fri May 25 01:42:58 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page