Sciweavers

337 search results - page 37 / 68
» Mean-Variance Optimization in Markov Decision Processes
Sort
View
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
AAAI
2006
13 years 9 months ago
Learning Basis Functions in Hybrid Domains
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
IJCAI
2003
13 years 9 months ago
Multiple-Goal Reinforcement Learning with Modular Sarsa(0)
We present a new algorithm, GM-Sarsa(0), for finding approximate solutions to multiple-goal reinforcement learning problems that are modeled as composite Markov decision processe...
Nathan Sprague, Dana H. Ballard
AAAI
2007
13 years 10 months ago
Scaling Up: Solving POMDPs through Value Based Clustering
Partially Observable Markov Decision Processes (POMDPs) provide an appropriately rich model for agents operating under partial knowledge of the environment. Since finding an opti...
Yan Virin, Guy Shani, Solomon Eyal Shimony, Ronen ...
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
14 years 2 months ago
Finding Best k Policies
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 ...
Peng Dai, Judy Goldsmith