The Complexity of Model Aggregation

No abstract is available for this paper.

• Publication year

  2000

• Venue

  International Conference on Artificial Intelligence Planning Systems

• Publication date

  2000-04-14

• Fields of study

  Mathematics, Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Complexity of finite-horizon Markov decision process problems

  2000cited by this paper
• Stochastic dynamic programming with factored representations

  2000cited by this paper
• A Generalization of the Concept of Markov Decision Process to Imprecise Probabilities

  1999cited by this paper
• Decision-Theoretic Planning: Structural Assumptions and Computational Leverage

  1999cited by this paper
• Initial Experiments in Stochastic Satisfiability

  1999cited by this paper
• SPUDD: Stochastic Planning using Decision Diagrams

  1999cited by this paper
• Decision-Theoretic Planning

  1999cited by this paper
• Using Caching to Solve Larger Probabilistic Planning Problems

  1998cited by this paper
• MAXPLAN: A New Approach to Probabilistic Planning

  1998cited by this paper
• The Computational Complexity of Probabilistic Planning

  1998cited by this paper
• Complexity issues in Markov decision processes

  1998cited by this paper
• The Complexity of Plan Existence and Evaluation in Probabilistic Domains

  1997cited by this paper
• Model Reduction Techniques for Computing Approximately Optimal Solutions for Markov Decision Processes

  1997cited by this paper
• Model Minimization, Regression, and Propositional STRIPS Planning

  1997cited by this paper
• Model Minimization in Markov Decision Processes

  1997cited by this paper
• Encyclopaedia of Complexity Results for Finite-Horizon Markov Decision Process Problems

  1997cited by this paper
• Model Minimization in Markov Decision

  1997cited by this paper
• Bounded Parameter Markov Decision Processes

  1997cited by this paper
• Probabilistic Propositional Planning: Representations and Complexity

  1997cited by this paper
• Approximate Value Trees in Structured Dynamic Programming

  1996cited by this paper
• Feature-based methods for large scale dynamic programming

  1995cited by this paper
• Exploiting Structure in Policy Construction

  1995cited by this paper
• PP is as Hard as the Polynomial-Time Hierarchy

  1991influential reference
• Complexity classes defined by counting quantifiers

  1991cited by this paper
• Modified Policy Iteration Algorithms for Discounted Markov Decision Problems

  1978cited by this paper
• Dynamic Programming

  1957influential reference
• Complexity Classes Deened by Counting Quantiiers*

  year unknowncited by this paper

• An Analytic Characterization of Model Minimization in Factored Markov Decision Processes

  2010cites this paper
• On the relationship between MDPs and the BDI architecture

  2006cites this paper
• Solving factored MDPs using non-homogeneous partitions

  2003cites this paper
• Equivalence notions and model minimization in Markov decision processes

  2003influential citation
• Markov Indecision Processes: A Formal Model of Decision-Making Under Extreme Confusion

  2003cites this paper
• Solving Factored MDPs via Non-Homogeneous Partitioning

  2001cites this paper
• Solving Factored MDPs Using Non-homogeneous Partitions

  1998cites this paper