682 search results - page 84 / 137 » One-Counter Markov Decision Processes |
106
Voted
GLOBECOM
2008
IEEE
15 years 7 months ago
2008
IEEE
—We consider peer-to-peer (P2P) networks, where multiple peers are interested in sharing content. While sharing resources, autonomous and self-interested peers need to make decis...
105
click to vote
AIPS
2000
15 years 2 months ago
2000
1 We consider the problem of scheduling an unknown sequence of tasks for a single server as the tasks arrive with the goal off maximizing the total weighted value of the tasks serv...
113
Voted
CORR
2006
Springer
15 years 25 days ago
2006
Springer
This paper addresses the issue of policy evaluation in Markov Decision Processes, using linear function approximation. It provides a unified view of algorithms such as TD(), LSTD()...
120
Voted
DSN
2009
IEEE
14 years 10 months ago
2009
IEEE
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...
136
Voted
GECCO
2009
Springer
14 years 10 months ago
2009
Springer
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...