Pol Blasco
2014 IEEE International Conference on Communications (ICC) · 2014
A researcher in the Science corpus: 1 paper; trusts 2 researchers and is trusted by 4 researchers here, as inferred from the citation graph.
Whom Pol Blasco trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Sébastien Bubeck
- Nicolò Cesa-Bianchi
- Tze Leung Lai
- Peter Auer
- Alper Atamtürk
- Yasin Abbasi-Yadkori
- S. Borst
Who trusts Pol Blasco overall
Papers from Pol Blasco's perspective
Ordered by how strongly the researchers Pol Blasco trusts endorse each paper. Same corpus, a different order for every researcher.
- Asymptotically efficient adaptive allocation rules
- Finite-time Analysis of the Multiarmed Bandit Problem
- Improved Algorithms for Linear Stochastic Bandits
- Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
- FemtoCaching: Wireless video content delivery through distributed caching helpers (2012 Proceedings IEEE INFOCOM)
- Distributed Caching Algorithms for Content Distribution Networks (2010 Proceedings IEEE INFOCOM)
- Integer-Programming Software Systems
- Some aspects of the sequential design of experiments
- Near-optimal Regret Bounds for Reinforcement Learning
- Contextual Bandits with Linear Payoff Functions
Their papers
- Learning-based optimization of cache content in a small cell base station (2014) — 299 citations