Login / Signup
A Technique to Obtain Hardness Results for Randomized Online Algorithms - A Survey.
Hans-Joachim Böckenhauer
Juraj Hromkovic
Dennis Komm
Published in:
Computing with New Resources (2014)
Keyphrases
</>
online algorithms
online learning
worst case
lower bound
competitive ratio
np hard
computational complexity
learning algorithm
average case
special case
data sets
upper bound
semi supervised
support vector
bayesian networks
steady state
data mining