Sciweavers

66 search results - page 11 / 14
» The Nonstochastic Multiarmed Bandit Problem
Sort
View
ICML
2003
IEEE
14 years 8 months ago
Online Choice of Active Learning Algorithms
This paper is concerned with the question of how to online combine an ensemble of active learners so as to expedite the learning progress during a pool-based active learning sessi...
Yoram Baram, Ran El-Yaniv, Kobi Luz
NETWORKING
2007
13 years 9 months ago
Reinforcement Learning-Based Load Shared Sequential Routing
We consider event dependent routing algorithms for on-line explicit source routing in MPLS networks. The proposed methods are based on load shared sequential routing in which load ...
Fariba Heidari, Shie Mannor, Lorne Mason
IOR
2007
95views more  IOR 2007»
13 years 7 months ago
Index Policies for Shooting Problems
We consider a scenario in which a single Red wishes to shoot at a collection of Blue targets, one at a time, to maximise some measure of return obtained from Blues killed before R...
Kevin D. Glazebrook, Christopher Kirkbride, H. M. ...
CORR
2011
Springer
198views Education» more  CORR 2011»
12 years 11 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
GECCO
2010
Springer
191views Optimization» more  GECCO 2010»
14 years 11 days ago
Toward comparison-based adaptive operator selection
Adaptive Operator Selection (AOS) turns the impacts of the applications of variation operators into Operator Selection through a Credit Assignment mechanism. However, most Credit ...
Álvaro Fialho, Marc Schoenauer, Michè...