Carlos Guestrin, Daphne Koller, and Ronald Parr. Max-norm projections for factored MDPs. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, pages 673--682, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
Polynomial Value Iteration Algorithms for Deterministic MDPs - Omid Madani Department (2002) (Correct)
.... these problems are used repeatedly in solving problem variants such as stochastic games, and partially observable MDPs [Sha53, Han98] Preferred methods for solving MDP problems use dynamic programming techniques, and in particular often contain a so called value iteration or policy iteration loop [Put94, Lit96, Han98, GKP01]. These methods converge to optimal solutions quickly in practice, but we know little about their asymptotic complexity. It is known, however, that algorithms based on value iteration have no better than a pseudo polynomial run time on MDP prob An algorithm has pseudo polynomial run time ....
C. Guestrin, D. Koller, and R. Parr. Max-norm projections for factored MDPs. In AAAI, pages 673-- 679, 2001.
Journal of Machine Learning Research 7 (2006) 2259-2301.. - Anders Jonsson Anders Self-citation (Guestrin) (Correct)
No context found.
C. Guestrin, D. Koller, and R. Parr. Max-norm Projections for Factored MDPs. International Joint Conference on Artificial Intelligence, 17:673--680, 2001.
Appeared in the Twentieth Conference on Uncertainty in.. - Solving Factored Mdps (2004) Self-citation (Guestrin) (Correct)
No context found.
C. E. Guestrin, D. Koller, and R. Parr. Max-norm projections for factored MDPs. In IJCAI, 2001.
AAAI Spring Symposium, Stanford, California, March 2002. - Context Specific Multiagent (2002) Self-citation (Guestrin Koller) (Correct)
No context found.
Carlos Guestrin, Daphne Koller, and Ronald Parr. Max-norm projections for factored MDPs. In Proc. of IJCAI-01, 2001.
Greedy linear value-approximation for factored Markov.. - Relu Patrascu Rpatrasc (2002) (2 citations) Self-citation (Guestrin) (Correct)
No context found.
Guestrin, C.; Koller, D.; and Parr, R. 2001a. Max-norm projection for factored MDPs. In Proceedings IJCAI.
Solving Factored MDPs with Continuous and Discrete Variables - Guestrin, Hauskrecht.. (2004) Self-citation (Guestrin) (Correct)
No context found.
C. E. Guestrin, D. Koller, and R. Parr. Max-norm projections for factored MDPs. In IJCAI, 2001.
Multi-Agent Planning in Complex Uncertain Environments - Koller (2004) Self-citation (Koller) (Correct)
No context found.
C. E. Guestrin, D. Koller, and R. Parr. Max-norm projections for factored MDPs. In Proc. Seventeenth International Joint Conference on Artificial Intelligence (IJCAI-01), pages 673 -- 680, 2001.
Solving Factored MDPs with Continuous and Discrete Variables - Guestrin, Hauskrecht.. (2004) Self-citation (Guestrin) (Correct)
No context found.
C. E. Guestrin, D. Koller, and R. Parr. Max-norm projections for factored MDPs. In IJCAI, 2001.
Solving Factored MDPs with Continuous and Discrete Variables - Guestrin, Hauskrecht.. (2004) Self-citation (Guestrin) (Correct)
No context found.
C. E. Guestrin, D. Koller, and R. Parr. Max-norm projections for factored MDPs. In IJCAI, 2001.
Solving Factored MDPs with Continuous and Discrete Variables - Guestrin, Hauskrecht.. (2004) Self-citation (Guestrin) (Correct)
No context found.
C. E. Guestrin, D. Koller, and R. Parr. Max-norm projections for factored MDPs. In IJCAI, 2001.
Coordinated Reinforcement Learning - Carlos Guestrin Guestrin (7 citations) Self-citation (Guestrin Parr) (Correct)
No context found.
C. Guestrin, D. Koller, and R. Parr. Max-norm projections for factored MDPs. In IJCAI-01, 2001.
Monte-Carlo optimizations for resource allocation problems .. - Network Systems Milos (Correct)
No context found.
Carlos Guestrin, Daphne Koller, and Ronald Parr. Max-norm projections for factored MDPs. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, pages 673--682, 2001.
Approximate Linear Programming for Solving - Hybrid Factored Mdps (Correct)
No context found.
Carlos Guestrin, Daphne Koller, and Ronald Parr. Max-norm projections for factored MDPs. In Proceedings of the 17th International Joint Conference on Artificial Intelligence, pages 673-- 682, 2001.
Planning In Hybrid Structured Stochastic - Domains Comenius University (Correct)
No context found.
Carlos Guestrin, Daphne Koller, and Ronald Parr. Max-norm projections for factored MDPs. In Proceedings of the 17th International Joint Conference on Artificial Intelligence, pages 673--682, 2001.
Linear Program Approximations for Factored Continuous-State .. - Hauskrecht, Kveton (2003) (Correct)
No context found.
C. Guestrin, D. Koller, and R. Parr. Max-norm projections for factored MDPs. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, pages 673--682, 2001.
VDCBPI: an Approximate Scalable Algorithm - For Large Pomdps (Correct)
No context found.
C. Guestrin, D. Koller, and R. Parr. Max-norm projections for factored MDPs. Proc. IJCAI-01, pp.673--680, Seattle, WA, 2001.
Solving Factored MDPs with Exponential-Family Transition Models - Kveton, Hauskrecht (2006) (Correct)
No context found.
Guestrin, C.; Koller, D.; and Parr, R. 2001. Max-norm projections for factored MDPs. In Proceedings of the 17th International Joint Conference on Artificial Intelligence, 673--682.
Approximate Linear Programming for Solving Hybrid Factored MDPs - Hauskrecht, Kveton (Correct)
No context found.
Carlos Guestrin, Daphne Koller, and Ronald Parr. Max-norm projections for factored MDPs. In Proceedings of the 17th International Joint Conference on Artificial Intelligence, pages 673-- 682, 2001.
Heuristic Refinements of Approximate Linear Programming for .. - Kveton, Hauskrecht (2004) (Correct)
No context found.
Guestrin, C.; Koller, D.; and Parr, R. 2001. Max-norm projections for factored MDPs. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 673--682.
An MCMC Approach to Solving Hybrid Factored MDPs - Kveton, Hauskrecht (2005) (1 citation) (Correct)
No context found.
Carlos Guestrin, Daphne Koller, and Ronald Parr. Max-norm projections for factored MDPs. In Proceedings of the 17th International Joint Conference on Artificial Intelligence, pages 673--682, 2001.
Linear Program Approximations for Factored Continuous-State .. - Hauskrecht, Kveton (2003) (Correct)
No context found.
C. Guestrin, D. Koller, and R. Parr. Max-norm projections for factored MDPs. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, pages 673--682, 2001.
Approximate Policy Iteration with a Policy Language Bias - Fern, Yoon, Givan (2003) (1 citation) (Correct)
No context found.
Carlos Guestrin, Daphne Koller, and Ronald Parr. Max-norm projections for factored MDPs. In IJCAI, pages 673--680, 2001.
Efficient Max-Norm Distance Computation and Reliable .. - Varadhan, Krishnan, .. (2003) (Correct)
No context found.
C. Guestrin, D. Koller, and R. Parr. Max-norm projections for factored mdps. In Proc. of IJCAI, pages 673--680, 2001.
Constraint-based Optimization with the Minimax.. - Boutilier.. (2003) (1 citation) (Correct)
No context found.
C. Guestrin, D. Koller, and R. Parr. Max-norm projections for factored MDPs. In Proc. 17th Intl. Joint Conf. on AI, pp.673--680, Seattle, 2001.
Monte-Carlo optimizations for resource allocation problems in.. - Milos (Correct)
No context found.
Carlos Guestrin, Daphne Koller, and Ronald Parr. Max-norm projections for factored MDPs. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, pages 673--682, 2001.
First 50 documents
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC