1 code implementation • NeurIPS 2015 • Richard Combes, M. Sadegh Talebi, Alexandre Proutiere, Marc Lelarge
In the adversarial setting under bandit feedback, we propose \textsc{CombEXP}, an algorithm with the same regret scaling as state-of-the-art algorithms, but with lower computational complexity for some combinatorial problems.
no code implementations • 27 Sep 2013 • M. Sadegh Talebi, Zhenhua Zou, Richard Combes, Alexandre Proutiere, Mikael Johansson
The parameters, and hence the optimal path, can only be estimated by routing packets through the network and observing the realized delays.
no code implementations • 27 Feb 2013 • Marc Lelarge, Alexandre Proutiere, M. Sadegh Talebi
We consider the problem of allocating radio channels to links in a wireless network.
