656 search results - page 102 / 132 » Complexity of finite-horizon Markov decision process problem... |
144
Voted
ICML
2007
IEEE
16 years 2 months ago
2007
IEEE
We consider the problem of multi-task reinforcement learning, where the agent needs to solve a sequence of Markov Decision Processes (MDPs) chosen randomly from a fixed but unknow...
123
click to vote
GLOBECOM
2006
IEEE
15 years 8 months ago
2006
IEEE
— This paper addresses learning based adaptive resource allocation for wireless MIMO channels with Markovian fading. The problem is posed as Constrained Markov Decision Process w...
118
click to vote
AAAI
2010
15 years 3 months ago
2010
Partially-observable Markov decision processes (POMDPs) provide a powerful model for sequential decision-making problems with partially-observed state and are known to have (appro...
112
Voted
AAAI
2006
15 years 3 months ago
2006
We present a new algorithm, called incremental least squares policy iteration (ILSPI), for finding the infinite-horizon stationary policy for partially observable Markov decision ...
125
click to vote
GLOBECOM
2010
IEEE
14 years 12 months ago
2010
IEEE
In cognitive networks, since nodes generally belong to different authorities and pursue different goals, they will not cooperate with others unless cooperation can improve their ow...