515 search results - page 54 / 103 » Approximating Markov Processes by Averaging |
213
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We consider an opportunistic spectrum access (OSA) problem where the time-varying condition of each channel (e.g., as a result of random fading or certain primary users' activ...
167
click to vote
GLOBECOM
2006
IEEE
16 years 23 days ago
2006
IEEE
Abstract— We consider discrete-time channels with finitelength intersymbol interference and additive Gaussian noise. The channel noise is considered to be a stationary ARMA (aut...
163
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
— This paper explores optimization of paging and registration policies in cellular networks. Motion is modeled as a discrete-time Markov process, and minimization of the discount...
141
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
This paper investigates the problem of automatically learning how to restructure the reward function of a Markov decision process so as to speed up reinforcement learning. We begi...
180
click to vote
AAAI
2006
15 years 8 months ago
2006
We introduce point-based dynamic programming (DP) for decentralized partially observable Markov decision processes (DEC-POMDPs), a new discrete DP algorithm for planning strategie...