Sciweavers

Share
280 search results - page 1 / 56
» Planning for Markov Decision Processes with Sparse Stochasti...
Sort
View
NIPS
2004
10 years 3 months ago
Planning for Markov Decision Processes with Sparse Stochasticity
Maxim Likhachev, Geoffrey J. Gordon, Sebastian Thr...
ML
2002
ACM
143views Machine Learning» more  ML 2002»
10 years 2 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
UAI
2000
10 years 3 months ago
Fast Planning in Stochastic Games
Stochastic games generalize Markov decision processes MDPs to a multiagent setting by allowing the state transitions to depend jointly on all player actions, and having rewards de...
Michael J. Kearns, Yishay Mansour, Satinder P. Sin...
ICWS
2004
IEEE
10 years 4 months ago
Dynamic Workflow Composition using Markov Decision Processes
The advent of Web services has made automated workflow composition relevant to Web based applications. One technique that has received some attention, for automatically composing ...
Prashant Doshi, Richard Goodwin, Rama Akkiraju, Ku...
AAAI
1997
10 years 3 months ago
Model Minimization in Markov Decision Processes
Many stochastic planning problems can be represented using Markov Decision Processes (MDPs). A difficulty with using these MDP representations is that the common algorithms for so...
Thomas Dean, Robert Givan
books