Sciweavers

24 search results - page 1 / 5
» Factored MCTS for Large Scale Stochastic Planning
Sort
View
ML
2002
ACM
143views Machine Learning» more  ML 2002»
13 years 4 months ago
A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
Michael J. Kearns, Yishay Mansour, Andrew Y. Ng
AIPS
1998
13 years 6 months ago
Solving Stochastic Planning Problems with Large State and Action Spaces
Planning methods for deterministic planning problems traditionally exploit factored representations to encode the dynamics of problems in terms of a set of parameters, e.g., the l...
Thomas Dean, Robert Givan, Kee-Eung Kim
ICIP
2009
IEEE
13 years 2 months ago
Virtual resolution enhancement of scale invariant textured images using stochastic processes
We present a new method of magnification for textured images featuring scale invariance properties. The procedure preserves the visual aspect as well as the statistical properties...
Emilie Koenig, Pierre Chainais
UAI
2001
13 years 6 months ago
A Clustering Approach to Solving Large Stochastic Matching Problems
In this work we focus on efficient heuristics for solving a class of stochastic planning problems that arise in a variety of business, investment, and industrial applications. The...
Milos Hauskrecht, Eli Upfal
ATAL
2006
Springer
13 years 8 months ago
Resource allocation among agents with preferences induced by factored MDPs
Distributing scarce resources among agents in a way that maximizes the social welfare of the group is a computationally hard problem when the value of a resource bundle is not lin...
Dmitri A. Dolgov, Edmund H. Durfee