Sciweavers

268 search results - page 50 / 54
» Solving multiagent assignment Markov decision processes
Sort
View
NIPS
2008
13 years 11 months ago
Biasing Approximate Dynamic Programming with a Lower Discount Factor
Most algorithms for solving Markov decision processes rely on a discount factor, which ensures their convergence. It is generally assumed that using an artificially low discount f...
Marek Petrik, Bruno Scherrer
NIPS
2007
13 years 11 months ago
Optimistic Linear Programming gives Logarithmic Regret for Irreducible MDPs
We present an algorithm called Optimistic Linear Programming (OLP) for learning to optimize average reward in an irreducible but otherwise unknown Markov decision process (MDP). O...
Ambuj Tewari, Peter L. Bartlett
IJCAI
2003
13 years 11 months ago
Approximating Optimal Policies for Agents with Limited Execution Resources
An agent with limited consumable execution resources needs policies that attempt to achieve good performance while respecting these limitations. Otherwise, an agent (such as a pla...
Dmitri A. Dolgov, Edmund H. Durfee
DSN
2009
IEEE
13 years 7 months ago
RRE: A game-theoretic intrusion Response and Recovery Engine
Preserving the availability and integrity of networked computing systems in the face of fast-spreading intrusions requires advances not only in detection algorithms, but also in a...
Saman A. Zonouz, Himanshu Khurana, William H. Sand...
GECCO
2009
Springer
162views Optimization» more  GECCO 2009»
13 years 7 months ago
Uncertainty handling CMA-ES for reinforcement learning
The covariance matrix adaptation evolution strategy (CMAES) has proven to be a powerful method for reinforcement learning (RL). Recently, the CMA-ES has been augmented with an ada...
Verena Heidrich-Meisner, Christian Igel