Optimal lower bounds for projective list update algorithms.
Christoph AmbühlBernd GärtnerBernhard von StengelPublished in: ACM Trans. Algorithms (2013)
Keyphrases
- lower bound
- worst case
- times faster
- significant improvement
- learning algorithm
- running times
- online algorithms
- exhaustive search
- closed form
- orders of magnitude
- computationally efficient
- objective function
- optimization problems
- computational cost
- branch and bound algorithm
- dynamic programming
- genetic algorithm
- min sum
- approximately optimal