Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm

Posted on October 23, 2014 by
by Sascha Geulen, Berthold Vöcking, Melanie Winkler
View PDF
Reference:
Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm (Sascha Geulen, Berthold Vöcking, Melanie Winkler), In COLT 2010 – The 23rd Conference on Learning Theory, Haifa, Israel, June 27-29, 2010, 2010.
Bibtex Entry:
@inproceedings{DBLP:conf/colt/GeulenVW10,
  author    = {Sascha Geulen and
               Berthold V{"{o}}cking and
               Melanie Winkler},
  title     = {Regret Minimization for Online Buffering Problems Using the Weighted
               Majority Algorithm},
  booktitle = {{COLT} 2010 - The 23rd Conference on Learning Theory, Haifa, Israel,
               June 27-29, 2010},
  year      = {2010},
  pages     = {132--143},
  crossref  = {DBLP:conf/colt/2010},
  url       = {http://colt2010.haifa.il.ibm.com/papers/COLT2010proceedings.pdf#page=140},
  timestamp = {Mon, 15 Sep 2014 11:32:15 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/colt/GeulenVW10},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}

Bookmark the permalink.