Sciweavers

683 search results - page 122 / 137
» Coarticulation in Markov Decision Processes
Sort
View
SODA
2004
ACM
94views Algorithms» more  SODA 2004»
13 years 9 months ago
Quantitative stochastic parity games
We study perfect-information stochastic parity games. These are two-player nonterminating games which are played on a graph with turn-based probabilistic transitions. A play resul...
Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A...
NIPS
2003
13 years 9 months ago
Distributed Optimization in Adaptive Networks
We develop a protocol for optimizing dynamic behavior of a network of simple electronic components, such as a sensor network, an ad hoc network of mobile devices, or a network of ...
Ciamac Cyrus Moallemi, Benjamin Van Roy
NIPS
2003
13 years 9 months ago
A Nonlinear Predictive State Representation
Predictive state representations (PSRs) use predictions of a set of tests to represent the state of controlled dynamical systems. One reason why this representation is exciting as...
Matthew R. Rudary, Satinder P. Singh
UAI
2000
13 years 9 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...
ATAL
2010
Springer
13 years 8 months ago
Self-organization for coordinating decentralized reinforcement learning
Decentralized reinforcement learning (DRL) has been applied to a number of distributed applications. However, one of the main challenges faced by DRL is its convergence. Previous ...
Chongjie Zhang, Victor R. Lesser, Sherief Abdallah