334 search results - page 41 / 67 » How to Dynamically Merge Markov Decision Processes |
147
Voted
ICN
2007
Springer
15 years 10 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 ...
129
click to vote
AIPS
2008
15 years 6 months ago
2008
We address the problem of coordinating the plans and schedules for a team of agents in an uncertain and dynamic environment. Bounded rationality, bounded communication, subjectivi...
110
Voted
UAI
2004
15 years 5 months ago
2004
We present a major improvement to the incremental pruning algorithm for solving partially observable Markov decision processes. Our technique targets the cross-sum step of the dyn...
114
click to vote
NIPS
2003
15 years 5 months ago
2003
Online mechanism design (MD) considers the problem of providing incentives to implement desired system-wide outcomes in systems with self-interested agents that arrive and depart ...
157
click to vote
BMCBI
2006
15 years 4 months ago
2006
Background: Stochastic simulation has become a useful tool to both study natural biological systems and design new synthetic ones. By capturing the intrinsic molecular fluctuation...