11 search results - page 1 / 3 » Solving Very Large Weakly Coupled Markov Decision Processes |
AAAI
1998
15 years 5 days ago
1998
We present a technique for computing approximately optimal solutions to stochastic resource allocation problems modeled as Markov decision processes (MDPs). We exploit two key pro...
104
click to vote
UAI
1998
15 years 4 days ago
1998
This paper presents two new approaches to decomposing and solving large Markov decision problems (MDPs), a partial decoupling method and a complete decoupling method. In these app...
AAAI
1997
15 years 5 days ago
1997
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...
101
click to vote
ICTAI
2000
IEEE
15 years 2 months ago
2000
IEEE
Markov Decision Processes (MDP) have been widely used as a framework for planning under uncertainty. They allow to compute optimal sequences of actions in order to achieve a given...
119
Voted
ICFP
2010
ACM
14 years 12 months ago
2010
ACM
Modern proof assistants such as Coq and Isabelle provide high degrees of expressiveness and assurance because they support formal reasoning in higher-order logic and supply explic...