334 search results - page 2 / 67 » How to Dynamically Merge Markov Decision Processes |
DAC
1999
ACM
14 years 6 months ago
1999
ACM
NIPS
2004
13 years 6 months ago
2004
We investigate an approach for simultaneously committing to multiple activities, each modeled as a temporally extended action in a semi-Markov decision process (SMDP). For each ac...
CDC
2010
IEEE
13 years 15 days ago
2010
IEEE
We give an optimal dynamic programming algorithm to solve a class of finite-horizon decentralized Markov decision processes (MDPs). We consider problems with a broadcast informati...
SARA
2007
Springer
13 years 11 months ago
2007
Springer
Several recent techniques for solving Markov decision processes use dynamic Bayesian networks to compactly represent tasks. The dynamic Bayesian network representation may not be g...
ICWS
2004
IEEE
13 years 6 months ago
2004
IEEE
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 ...