Sciweavers

268 search results - page 29 / 54
» Solving multiagent assignment Markov decision processes
Sort
View
146
Voted
PUK
2000
15 years 4 months ago
Dynamic Scheduling of Progressive Processing Plans
Progressive processing plans allow systems to tradeoff computational resources against the quality of service by specifying alternative ways in which to accomplish each step. When ...
Shlomo Zilberstein, Abdel-Illah Mouaddib, Andrew A...
144
Voted
QEST
2010
IEEE
15 years 1 months ago
Symblicit Calculation of Long-Run Averages for Concurrent Probabilistic Systems
Abstract--Model checkers for concurrent probabilistic systems have become very popular within the last decade. The study of long-run average behavior has however received only scan...
Ralf Wimmer, Bettina Braitling, Bernd Becker, Erns...
110
Voted
ECML
2006
Springer
15 years 5 months ago
Reinforcement Learning for MDPs with Constraints
In this article, I will consider Markov Decision Processes with two criteria, each defined as the expected value of an infinite horizon cumulative return. The second criterion is e...
Peter Geibel
ICML
2006
IEEE
16 years 4 months ago
Qualitative reinforcement learning
When the transition probabilities and rewards of a Markov Decision Process are specified exactly, the problem can be solved without any interaction with the environment. When no s...
Arkady Epshteyn, Gerald DeJong
ATAL
2011
Springer
14 years 3 months ago
Towards a unifying characterization for quantifying weak coupling in dec-POMDPs
Researchers in the field of multiagent sequential decision making have commonly used the terms “weakly-coupled” and “loosely-coupled” to qualitatively classify problems i...
Stefan J. Witwicki, Edmund H. Durfee