Sciweavers

371 search results - page 62 / 75
» The Complexity of Decentralized Control of Markov Decision P...
Sort
View
ATAL
2007
Springer
15 years 3 months ago
Combinatorial resource scheduling for multiagent MDPs
Optimal resource scheduling in multiagent systems is a computationally challenging task, particularly when the values of resources are not additive. We consider the combinatorial ...
Dmitri A. Dolgov, Michael R. James, Michael E. Sam...
EENERGY
2010
15 years 1 months ago
Optimal sleep patterns for serving delay-tolerant jobs
Sleeping is an important method to reduce energy consumption in many information and communication systems. In this paper we focus on a typical server under dynamic load, where en...
Ioannis Kamitsos, Lachlan L. H. Andrew, Hongseok K...
CN
2002
127views more  CN 2002»
14 years 9 months ago
Optimal policy for label switched path setup in MPLS networks
An important aspect in designing a multiprotocol label switching (MPLS) network is to determine an initial topology and to adapt it to the traffic load. A topology change in an MP...
Tricha Anjali, Caterina M. Scoglio, Jaudelice Cava...
ICML
2009
IEEE
15 years 10 months ago
Predictive representations for policy gradient in POMDPs
We consider the problem of estimating the policy gradient in Partially Observable Markov Decision Processes (POMDPs) with a special class of policies that are based on Predictive ...
Abdeslam Boularias, Brahim Chaib-draa
ATAL
2009
Springer
15 years 4 months ago
SarsaLandmark: an algorithm for learning in POMDPs with landmarks
Reinforcement learning algorithms that use eligibility traces, such as Sarsa(λ), have been empirically shown to be effective in learning good estimated-state-based policies in pa...
Michael R. James, Satinder P. Singh