13 search results - page 3 / 3 » On the Combinatorial Multi-Armed Bandit Problem with Markovi... |
WIOPT
2011
IEEE
12 years 11 months ago
2011
IEEE
Abstract—This paper considers maximizing throughput utility in a multi-user network with partially observable Markov ON/OFF channels. Instantaneous channel states are never known...
CDC
2009
IEEE
14 years 4 days ago
2009
IEEE
We consider a class of restless multi-armed bandit problems that arises in multi-channel opportunistic communications, where channels are modeled as independent and stochastically...
CORR
2010
Springer
13 years 2 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...