ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1407.6154
  4. Cited By
Content-Level Selective Offloading in Heterogeneous Networks:
  Multi-armed Bandit Optimization and Regret Bounds

Content-Level Selective Offloading in Heterogeneous Networks: Multi-armed Bandit Optimization and Regret Bounds

23 July 2014
Pol Blasco
Deniz Gündüz
ArXiv (abs)PDFHTML

Papers citing "Content-Level Selective Offloading in Heterogeneous Networks: Multi-armed Bandit Optimization and Regret Bounds"

1 / 1 papers shown
Title
Algorithms for multi-armed bandit problems
Algorithms for multi-armed bandit problems
Volodymyr Kuleshov
Doina Precup
150
351
0
25 Feb 2014
1