656 search results - page 10 / 132 » Complexity of finite-horizon Markov decision process problem... |
125
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
We consider finite horizon Markov decision processes under performance measures that involve both the mean and the variance of the cumulative reward. We show that either randomiz...
111
Voted
NIPS
2003
15 years 3 months ago
2003
Optimal solutions to Markov Decision Problems (MDPs) are very sensitive with respect to the state transition probabilities. In many practical problems, the estimation of those pro...
99
Voted
FLAIRS
2001
15 years 3 months ago
2001
Decisionand optimizationproblemsinvolvinggraphsarise in manyareas of artificial intelligence, including probabilistic networks, robot navigation, and network design. Manysuch prob...
106
click to vote
ECAI
2010
Springer
15 years 2 months ago
2010
Springer
A Markov Decision Process (MDP) is a general model for solving planning problems under uncertainty. It has been extended to multiobjective MDP to address multicriteria or multiagen...
120
click to vote
ATAL
2009
Springer
15 years 8 months ago
2009
Springer
We consider the setting of multiple collaborative agents trying to complete a set of tasks as assigned by a centralized controller. We propose a scalable method called“Assignmen...