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. 1509.03600
  4. Cited By
Hardness of Online Sleeping Combinatorial Optimization Problems

Hardness of Online Sleeping Combinatorial Optimization Problems

11 September 2015
Satyen Kale
Chansoo Lee
D. Pál
ArXivPDFHTML

Papers citing "Hardness of Online Sleeping Combinatorial Optimization Problems"

1 / 1 papers shown
Title
Online Learning in Markov Decision Processes with Adversarially Chosen
  Transition Probability Distributions
Online Learning in Markov Decision Processes with Adversarially Chosen Transition Probability Distributions
Yasin Abbasi-Yadkori
Peter L. Bartlett
Csaba Szepesvári
88
86
0
12 Mar 2013
1