Sciweavers

5 search results - page 1 / 1
» Online Learning in Opportunistic Spectrum Access: A Restless...
Sort
View
CORR
2010
Springer
171views Education» more  CORR 2010»
12 years 11 months ago
Online Learning in Opportunistic Spectrum Access: A Restless Bandit Approach
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...
Cem Tekin, Mingyan Liu
CORR
2011
Springer
210views Education» more  CORR 2011»
12 years 11 months ago
Online Learning of Rested and Restless Bandits
In this paper we study the online learning problem involving rested and restless multiarmed bandits with multiple plays. The system consists of a single player/user and a set of K...
Cem Tekin, Mingyan Liu
CORR
2010
Springer
143views Education» more  CORR 2010»
13 years 1 months ago
The Non-Bayesian Restless Multi-Armed Bandit: a Case of Near-Logarithmic Regret
In the classic Bayesian restless multi-armed bandit (RMAB) problem, there are N arms, with rewards on all arms evolving at each time as Markov chains with known parameters. A play...
Wenhan Dai, Yi Gai, Bhaskar Krishnamachari, Qing Z...
CORR
2011
Springer
198views Education» more  CORR 2011»
12 years 8 months ago
Decentralized Online Learning Algorithms for Opportunistic Spectrum Access
—The fundamental problem of multiple secondary users contending for opportunistic spectrum access over multiple channels in cognitive radio networks has been formulated recently ...
Yi Gai, Bhaskar Krishnamachari
ICASSP
2008
IEEE
13 years 11 months ago
Link throughput of multi-channel opportunistic access with limited sensing
—We aim to characterize the maximum link throughput of a multi-channel opportunistic communication system. The states of these channels evolve as independent and identically dist...
Keqin Liu, Qing Zhao