Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm.

Sascha Geulen Berthold Vöcking Melanie Winkler

Published in: COLT (2010)

Keyphrases

weighted majority
dynamic programming
learning algorithm
regret minimization
optimal solution
computational complexity
k means
objective function
worst case
genetic programming