15 search results - page 2 / 3 » Online Algorithms for the Multi-Armed Bandit Problem with Ma... |
CORR
2008
Springer
13 years 4 months ago
2008
Springer
In a multi-armed bandit problem, an online algorithm chooses from a set of strategies in a sequence of n trials so as to maximize the total payoff of the chosen strategies. While ...
CORR
2010
Springer
12 years 11 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...
FOCS
2007
IEEE
13 years 10 months ago
2007
IEEE
We consider a variant of the classic multi-armed bandit problem (MAB), which we call FEEDBACK MAB, where the reward obtained by playing each of n independent arms varies according...
GECCO
2010
Springer
13 years 9 months ago
2010
Springer
Adaptive Operator Selection (AOS) turns the impacts of the applications of variation operators into Operator Selection through a Credit Assignment mechanism. However, most Credit ...
CORR
2011
Springer
12 years 8 months ago
2011
Springer
—The fundamental problem of multiple secondary users contending for opportunistic spectrum access over multiple channels in cognitive radio networks has been formulated recently ...