280 search results - page 44 / 56 » Planning for Markov Decision Processes with Sparse Stochasti... |
126
click to vote
ATAL
2011
Springer
13 years 11 months ago
2011
Springer
Researchers in the field of multiagent sequential decision making have commonly used the terms “weakly-coupled” and “loosely-coupled” to qualitatively classify problems i...
109
click to vote
ALDT
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
GLOBECOM
2008
IEEE
15 years 6 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...
ATAL
2008
Springer
15 years 1 months ago
2008
Springer
The goal of Reinforcement learning (RL) is to maximize reward (minimize cost) in a Markov decision process (MDP) without knowing the underlying model a priori. RL algorithms tend ...
109
click to vote
ICN
2007
Springer
15 years 6 months ago
2007
Springer
— In this paper, we use the Markov Decision Process (MDP) technique to find the optimal code allocation policy in High-Speed Downlink Packet Access (HSDPA) networks. A discrete ...