Sciweavers

332 search results - page 51 / 67
» Ranking policies in discrete Markov decision processes
Sort
View
AIPS
2006
13 years 9 months ago
Solving Factored MDPs with Exponential-Family Transition Models
Markov decision processes (MDPs) with discrete and continuous state and action components can be solved efficiently by hybrid approximate linear programming (HALP). The main idea ...
Branislav Kveton, Milos Hauskrecht
AIPS
2009
13 years 9 months ago
Efficient Solutions to Factored MDPs with Imprecise Transition Probabilities
When modeling real-world decision-theoretic planning problems in the Markov decision process (MDP) framework, it is often impossible to obtain a completely accurate estimate of tr...
Karina Valdivia Delgado, Scott Sanner, Leliane Nun...
KDD
2010
ACM
293views Data Mining» more  KDD 2010»
13 years 11 months ago
BioSnowball: automated population of Wikis
Internet users regularly have the need to find biographies and facts of people of interest. Wikipedia has become the first stop for celebrity biographies and facts. However, Wik...
Xiaojiang Liu, Zaiqing Nie, Nenghai Yu, Ji-Rong We...
ICML
2003
IEEE
14 years 8 months ago
Exploration in Metric State Spaces
We present metric?? , a provably near-optimal algorithm for reinforcement learning in Markov decision processes in which there is a natural metric on the state space that allows t...
Sham Kakade, Michael J. Kearns, John Langford
GLOBECOM
2007
IEEE
14 years 2 months ago
Cognitive Medium Access: A Protocol for Enhancing Coexistence in WLAN Bands
— In this paper we propose Cognitive Medium Access (CMA), a protocol aimed at improving coexistence with a set of independently evolving WLAN bands. A time-slotted physical layer...
Stefan Geirhofer, Lang Tong, Brian M. Sadler