Eric A. Hansen

Orcid: 0000-0002-8445-2375

According to our database1, Eric A. Hansen authored at least 64 papers between 1994 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Strategy Graphs for Influence Diagrams.
J. Artif. Intell. Res., 2022

2021
An integrated approach to solving influence diagrams and finite-horizon partially observable decision processes.
Artif. Intell., 2021

2020
Improved Vector Pruning in Exact Algorithms for Solving POMDPs.
Proceedings of the Thirty-Sixth Conference on Uncertainty in Artificial Intelligence, 2020

2018
Strategy Representation and Compression for Influence Diagrams.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2018

2017
Error bounds for stochastic shortest path problems.
Math. Methods Oper. Res., 2017

2016
A POMDP Approach to Influence Diagram Evaluation.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

General Error Bounds in Heuristic Search Algorithms for Stochastic Shortest Path Problems.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Efficient Bounds in Heuristic Search Algorithms for Stochastic Shortest Path Problems.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2013
Solving Limited-Memory Influence Diagrams Using Branch-and-Bound Search.
Proceedings of the Twenty-Ninth Conference on Uncertainty in Artificial Intelligence, 2013

2011
Improving the Scalability of Optimal Bayesian Network Learning with External-Memory Frontier Breadth-First Branch and Bound Search.
Proceedings of the UAI 2011, 2011

Suboptimality Bounds for Stochastic Shortest Path Problems.
Proceedings of the UAI 2011, 2011

Branch and bound based feature elimination for support vector machine based classification of hyperspectral images.
Proceedings of the 2011 IEEE International Geoscience and Remote Sensing Symposium, 2011

Memory-Efficient Dynamic Programming for Learning Optimal Bayesian Networks.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010
Solving Multistage Influence Diagrams using Branch-and-Bound Search.
Proceedings of the UAI 2010, 2010

Edge Partitioning in Parallel Structured Duplicate Detection.
Proceedings of the Third Annual Symposium on Combinatorial Search, 2010

Parallel lexical-tree based LVCSR on multi-core processors.
Proceedings of the 11th Annual Conference of the International Speech Communication Association, 2010

2009
A Heuristic Search Approach to Planning with Continuous Resources in Stochastic Domains.
J. Artif. Intell. Res., 2009

Policy Iteration for Decentralized Control of Markov Decision Processes.
J. Artif. Intell. Res., 2009

Parallel fast likelihood computation for LVCSR using mixture decomposition.
Proceedings of the 10th Annual Conference of the International Speech Communication Association, 2009

Combining Breadth-First and Depth-First Strategies in Searching for Treewidth.
Proceedings of the IJCAI 2009, 2009

Efficient Computation of Jointree Bounds for Systematic MAP Search.
Proceedings of the IJCAI 2009, 2009

Analysis of a parallel lexical-tree-based speech decoder for multi-core processors.
Proceedings of the 17th European Signal Processing Conference, 2009

09491 Abstracts Collection - Graph Search Engineering.
Proceedings of the Graph Search Engineering, 29.11. - 04.12.2009, 2009

Dynamic State-Space Partitioning in External-Memory Graph Search.
Proceedings of the Graph Search Engineering, 29.11. - 04.12.2009, 2009

2008
Sparse Stochastic Finite-State Controllers for POMDPs.
Proceedings of the UAI 2008, 2008

Layered Duplicate Detection in External-Memory Model Checking.
Proceedings of the Model Checking Software, 2008

A lexical-tree division-based approach to parallelizing a cross-word speech decoder for multi-core processors.
Proceedings of the 2008 16th European Signal Processing Conference, 2008

2007
Anytime Heuristic Search.
J. Artif. Intell. Res., 2007

Edge Partitioning in External-Memory Graph Search.
Proceedings of the IJCAI 2007, 2007

Prioritizing Bellman Backups without a Priority Queue.
Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling, 2007

Parallel Structured Duplicate Detection.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

Indefinite-Horizon POMDPs with Action-Based Termination.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
Breadth-first heuristic search.
Artif. Intell., 2006

Memory-Efficient Symbolic Heuristic Search.
Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling, 2006

A Breadth-First Approach to Memory-Efficient Graph Search.
Proceedings of the Proceedings, 2006

Domain-Independent Structured Duplicate Detection.
Proceedings of the Proceedings, 2006

2005
Planning with Continuous Resources in Stochastic Domains.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

Bounded Policy Iteration for Decentralized POMDPs.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

Beam-Stack Search: Integrating Backtracking with Beam Search.
Proceedings of the Fifteenth International Conference on Automated Planning and Scheduling (ICAPS 2005), 2005

External-Memory Pattern Databases Using Structured Duplicate Detection.
Proceedings of the Proceedings, 2005

Incremental Estimation of Discrete Hidden Markov Models Based on a New Backward Procedure.
Proceedings of the Proceedings, 2005

2004
K-Group A for Multiple Sequence Alignment with Quasi-Natural Gap Costs.
Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2004), 2004

Structured Duplicate Detection in External-Memory Graph Search.
Proceedings of the Nineteenth National Conference on Artificial Intelligence, 2004

Space-Efficient Memory-Based Heuristics.
Proceedings of the Nineteenth National Conference on Artificial Intelligence, 2004

Dynamic Programming for Partially Observable Stochastic Games.
Proceedings of the Nineteenth National Conference on Artificial Intelligence, 2004

2003
Symbolic Generalization for On-line Planning.
Proceedings of the UAI '03, 2003

Sparse-Memory Graph Search.
Proceedings of the IJCAI-03, 2003

Sweep A*: Space-Efficient Heuristic Search in Partially Ordered Graphs.
Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2003), 2003

Synthesis of Hierarchical Finite-State Controllers for POMDPs.
Proceedings of the Thirteenth International Conference on Automated Planning and Scheduling (ICAPS 2003), 2003

2002
Symbolic Heuristic Search Using Decision Diagrams.
Proceedings of the Abstraction, 2002

Memory-Bounded A* Graph Search.
Proceedings of the Fifteenth International Florida Artificial Intelligence Research Society Conference, 2002

Multiple Sequence Alignment Using Anytime A<sup>*</sup>.
Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28, 2002

Symbolic Heuristic Search for Factored Markov Decision Processes.
Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28, 2002

2001
LAO<sup>*</sup>: A heuristic search algorithm that finds solutions with loops.
Artif. Intell., 2001

Monitoring and control of anytime algorithms: A dynamic programming approach.
Artif. Intell., 2001

An Improved Grid-Based Approximation Algorithm for POMDPs.
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 2001

2000
Dynamic Programming for POMDPs Using a Factored State Representation.
Proceedings of the Fifth International Conference on Artificial Intelligence Planning Systems, 2000

1998
Solving POMDPs by Searching in Policy Space.
Proceedings of the UAI '98: Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence, 1998

Heuristic Search in Cyclic AND/OR Graphs.
Proceedings of the Fifteenth National Conference on Artificial Intelligence and Tenth Innovative Applications of Artificial Intelligence Conference, 1998

1997
An Improved Policy Iteration Algorithm for Partially Observable MDPs.
Proceedings of the Advances in Neural Information Processing Systems 10, 1997

1996
Monitoring Anytime Algorithms.
SIGART Bull., 1996

Reinforcement Learning for Mixed Open-loop and Closed-loop Control.
Proceedings of the Advances in Neural Information Processing Systems 9, 1996

Monitoring the Progress of Anytime Problem-Solving.
Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, 1996

1994
Cost-Effective Sensing during Plan Execution.
Proceedings of the 12th National Conference on Artificial Intelligence, Seattle, WA, USA, July 31, 1994


  Loading...