default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEric A. Hansen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j10]Eric A. Hansen, Jinchuan Shi, James Kastrantas:
Strategy Graphs for Influence Diagrams. J. Artif. Intell. Res. 75: 1177-1221 (2022)- 2021
- [j9]Eric A. Hansen:
An integrated approach to solving influence diagrams and finite-horizon partially observable decision processes. Artif. Intell. 294: 103431 (2021) - 2020
- [c56]Eric A. Hansen, Thomas Bowman:
Improved Vector Pruning in Exact Algorithms for Solving POMDPs. UAI 2020: 1258-1267
2010 – 2019
- 2018
- [c55]Jinchuan Shi, Eric A. Hansen:
Strategy Representation and Compression for Influence Diagrams. ISAIM 2018 - 2017
- [j8]Eric A. Hansen
:
Error bounds for stochastic shortest path problems. Math. Methods Oper. Res. 86(1): 1-27 (2017) - 2016
- [c54]Eric A. Hansen, Ibrahim Abdoulahi:
General Error Bounds in Heuristic Search Algorithms for Stochastic Shortest Path Problems. AAAI 2016: 3130-3137 - [c53]Eric A. Hansen, Jinchuan Shi, Arindam Khaled:
A POMDP Approach to Influence Diagram Evaluation. IJCAI 2016: 3124-3132 - 2015
- [c52]Eric A. Hansen, Ibrahim Abdoulahi:
Efficient Bounds in Heuristic Search Algorithms for Stochastic Shortest Path Problems. AAAI 2015: 3283-3290 - 2014
- [i12]Nicolas Meuleau, Emmanuel Benazera, Ronen I. Brafman, Eric A. Hansen, Mausam:
A Heuristic Search Approach to Planning with Continuous Resources in Stochastic Domains. CoRR abs/1401.3428 (2014) - [i11]Daniel S. Bernstein, Christopher Amato, Eric A. Hansen, Shlomo Zilberstein:
Policy Iteration for Decentralized Control of Markov Decision Processes. CoRR abs/1401.3460 (2014) - 2013
- [c51]Arindam Khaled, Eric A. Hansen, Changhe Yuan:
Solving Limited-Memory Influence Diagrams Using Branch-and-Bound Search. UAI 2013 - [i10]Eric A. Hansen:
Solving POMDPs by Searching in Policy Space. CoRR abs/1301.7380 (2013) - [i9]Arindam Khaled, Eric A. Hansen, Changhe Yuan:
Solving Limited-Memory Influence Diagrams Using Branch-and-Bound Search. CoRR abs/1309.6839 (2013) - 2012
- [c50]Arindam Khaled, Changhe Yuan, Eric A. Hansen:
Solving Limited Memory Influence Diagrams Using Branch-and-Bound Search. ISAIM 2012 - [i8]Eric A. Hansen:
Suboptimality Bounds for Stochastic Shortest Path Problems. CoRR abs/1202.3729 (2012) - [i7]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. CoRR abs/1202.3744 (2012) - [i6]Changhe Yuan, XiaoJian Wu, Eric A. Hansen:
Solving Multistage Influence Diagrams using Branch-and-Bound Search. CoRR abs/1203.3531 (2012) - [i5]Eric A. Hansen:
Sparse Stochastic Finite-State Controllers for POMDPs. CoRR abs/1206.3263 (2012) - [i4]Zhengzhu Feng, Eric A. Hansen, Shlomo Zilberstein:
Symbolic Generalization for On-line Planning. CoRR abs/1212.2459 (2012) - 2011
- [c49]Brandon M. Malone, Changhe Yuan, Eric A. Hansen:
Memory-Efficient Dynamic Programming for Learning Optimal Bayesian Networks. AAAI 2011: 1057-1062 - [c48]Rong Zhou, Eric A. Hansen:
Dynamic State-Space Partitioning in External-Memory Graph Search. ICAPS 2011 - [c47]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 - [c46]Eric A. Hansen:
Suboptimality Bounds for Stochastic Shortest Path Problems. UAI 2011: 301-310 - [c45]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 - [i3]Eric A. Hansen, Rong Zhou:
Anytime Heuristic Search. CoRR abs/1110.2737 (2011) - 2010
- [c44]Naveen Parihar, Ralf Schlüter, David Rybach, Eric A. Hansen:
Parallel lexical-tree based LVCSR on multi-core processors. INTERSPEECH 2010: 1485-1488 - [c43]Rong Zhou, Tim Schmidt, Eric A. Hansen, Minh Binh Do, Serdar Uckun:
Edge Partitioning in Parallel Structured Duplicate Detection. SOCS 2010: 137-138 - [c42]Changhe Yuan, XiaoJian Wu, Eric A. Hansen:
Solving Multistage Influence Diagrams using Branch-and-Bound Search. UAI 2010: 691-700
2000 – 2009
- 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. 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. 34: 89-132 (2009) - [c41]Naveen Parihar, Eric A. Hansen:
Analysis of a parallel lexical-tree-based speech decoder for multi-core processors. EUSIPCO 2009: 2509-2513 - [c40]Rong Zhou, Eric A. Hansen:
Combining Breadth-First and Depth-First Strategies in Searching for Treewidth. IJCAI 2009: 640-645 - [c39]Changhe Yuan, Eric A. Hansen:
Efficient Computation of Jointree Bounds for Systematic MAP Search. IJCAI 2009: 1982-1989 - [c38]Naveen Parihar, Ralf Schlüter, David Rybach, Eric A. Hansen:
Parallel fast likelihood computation for LVCSR using mixture decomposition. INTERSPEECH 2009: 3047-3050 - [e2]Lubos Brim, Stefan Edelkamp, Eric A. Hansen, Peter Sanders:
Graph Search Engineering, 29.11. - 04.12.2009. Dagstuhl Seminar Proceedings 09491, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2009 [contents] - [i2]Rong Zhou, Eric A. Hansen:
Dynamic State-Space Partitioning in External-Memory Graph Search. Graph Search Engineering 2009 - [i1]Lubos Brim, Stefan Edelkamp, Eric A. Hansen, Peter Sanders:
09491 Abstracts Collection - Graph Search Engineering. Graph Search Engineering 2009 - 2008
- [c37]Naveen Parihar, Eric A. Hansen:
A lexical-tree division-based approach to parallelizing a cross-word speech decoder for multi-core processors. EUSIPCO 2008: 1-5 - [c36]Peter Lamborn, Eric A. Hansen:
Layered Duplicate Detection in External-Memory Model Checking. SPIN 2008: 160-175 - [c35]Eric A. Hansen:
Sparse Stochastic Finite-State Controllers for POMDPs. UAI 2008: 256-263 - [e1]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, ISBN 978-1-57735-386-7 [contents] - 2007
- [j5]Eric A. Hansen, Rong Zhou:
Anytime Heuristic Search. J. Artif. Intell. Res. 28: 267-297 (2007) - [c34]Rong Zhou, Eric A. Hansen:
Parallel Structured Duplicate Detection. AAAI 2007: 1217-1224 - [c33]Eric A. Hansen:
Indefinite-Horizon POMDPs with Action-Based Termination. AAAI 2007: 1237-1242 - [c32]Peng Dai, Eric A. Hansen:
Prioritizing Bellman Backups without a Priority Queue. ICAPS 2007: 113-119 - [c31]Rong Zhou, Eric A. Hansen:
Edge Partitioning in External-Memory Graph Search. IJCAI 2007: 2410-2417 - 2006
- [j4]Rong Zhou, Eric A. Hansen:
Breadth-first heuristic search. Artif. Intell. 170(4-5): 385-408 (2006) - [c30]Rong Zhou, Eric A. Hansen:
Domain-Independent Structured Duplicate Detection. AAAI 2006: 1082-1088 - [c29]Rong Zhou, Eric A. Hansen:
A Breadth-First Approach to Memory-Efficient Graph Search. AAAI 2006: 1695-1699 - [c28]Rune Møller 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]Rong Zhou, Eric A. Hansen:
External-Memory Pattern Databases Using Structured Duplicate Detection. AAAI 2005: 1398-1405 - [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]Rong Zhou, Eric A. Hansen:
Space-Efficient Memory-Based Heuristics. AAAI 2004: 677-682 - [c21]Rong Zhou, Eric A. Hansen:
Structured Duplicate Detection in External-Memory Graph Search. AAAI 2004: 683-689 - [c20]Eric A. Hansen, Daniel S. Bernstein, Shlomo Zilberstein:
Dynamic Programming for Partially Observable Stochastic Games. AAAI 2004: 709-715 - [c19]Rong Zhou, Eric A. Hansen:
Breadth-First Heuristic Search. ICAPS 2004: 92-100 - [c18]Rong Zhou, Eric A. Hansen:
K-Group A for Multiple Sequence Alignment with Quasi-Natural Gap Costs. ICTAI 2004: 688-695 - [c17]Rong Zhou, Eric A. Hansen:
Breadth-First Heuristic Search. KR 2004: 701-709 - 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]Rong Zhou, Eric A. Hansen:
Sparse-Memory Graph Search. IJCAI 2003: 1259-1268 - [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]Rong Zhou, Eric A. Hansen:
Multiple Sequence Alignment Using Anytime A*. AAAI/IAAI 2002: 975-977 - [c10]Rong Zhou, Eric A. Hansen:
Memory-Bounded A* Graph Search. FLAIRS 2002: 203-209 - [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
1990 – 1999
- 1998
- [c6]Eric A. Hansen, Shlomo Zilberstein:
Heuristic Search in Cyclic AND/OR Graphs. AAAI/IAAI 1998: 412-418 - [c5]Eric A. Hansen:
Solving POMDPs by Searching in Policy Space. UAI 1998: 211-219 - 1997
- [c4]Eric A. Hansen:
An Improved Policy Iteration Algorithm for Partially Observable MDPs. NIPS 1997: 1015-1021 - 1996
- [j1]Eric A. Hansen, Shlomo Zilberstein:
Monitoring Anytime Algorithms. SIGART Bull. 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]Eric A. Hansen:
Cost-Effective Sensing during Plan Execution. AAAI 1994: 1029-1035
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
