4 search results - page 1 / 1 » Combinatorial Network Optimization with Unknown Variables: M... |
CORR
2010
Springer
12 years 11 months ago
2010
Springer
In the classic multi-armed bandits problem, the goal is to have a policy for dynamically operating arms that each yield stochastic rewards with unknown means. The key metric of int...
CORR
2010
Springer
12 years 11 months ago
2010
Springer
We consider a combinatorial generalization of the classical multi-armed bandit problem that is defined as follows. There is a given bipartite graph of M users and N M resources. F...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We consider the restless multi-armed bandit (RMAB) problem with unknown dynamics. In this problem, at each time, a player chooses K out of N (N > K) arms to play. The state of ...
CISS
2008
IEEE
13 years 11 months ago
2008
IEEE
Motivated to design a feasible optical network architecture for the future Internet, we address the question of scheduling (wavelength assignment) in an optical network. The key ch...