Sciweavers

682 search results - page 45 / 137
» One-Counter Markov Decision Processes
Sort
View
INFOCOM
2011
IEEE
14 years 7 months ago
A dynamic relay selection scheme for mobile users in wireless relay networks
—Cooperative communication has attracted dramatic attention in the last few years due to its advantage in mitigating channel fading. Despite much effort that has been made in the...
Yifan Li, Ping Wang, Dusit Niyato, Weihua Zhuang
CORR
2012
Springer
286views Education» more  CORR 2012»
13 years 11 months ago
A Faster Algorithm for Solving One-Clock Priced Timed Games
One-clock priced timed games is a class of two-player, zero-sum, continuous-time games that was defined and thoroughly studied in previous works. We show that One-clock priced ti...
Thomas Dueholm Hansen, Rasmus Ibsen-Jensen, Peter ...
AAAI
2012
13 years 6 months ago
Kernel-Based Reinforcement Learning on Representative States
Markov decision processes (MDPs) are an established framework for solving sequential decision-making problems under uncertainty. In this work, we propose a new method for batchmod...
Branislav Kveton, Georgios Theocharous
PKDD
2009
Springer
129views Data Mining» more  PKDD 2009»
15 years 10 months ago
Considering Unseen States as Impossible in Factored Reinforcement Learning
Abstract. The Factored Markov Decision Process (FMDP) framework is a standard representation for sequential decision problems under uncertainty where the state is represented as a ...
Olga Kozlova, Olivier Sigaud, Pierre-Henri Wuillem...
CORR
2010
Springer
106views Education» more  CORR 2010»
15 years 3 months ago
MDPs with Unawareness
Markov decision processes (MDPs) are widely used for modeling decision-making problems in robotics, automated control, and economics. Traditional MDPs assume that the decision mak...
Joseph Y. Halpern, Nan Rong, Ashutosh Saxena