Improved Space Bounds for Strongly Competitive Randomized Paging Algorithms.
Gabriel MoruzAndrei NegoescuPublished in: ICALP (1) (2013)
Keyphrases
- randomized algorithms
- significant improvement
- worst case
- theoretical guarantees
- computational complexity
- computationally efficient
- data sets
- computational efficiency
- pac bayesian
- randomized algorithm
- generalization bounds
- equivalence classes
- lower and upper bounds
- error bounds
- theoretical analysis
- evolutionary algorithm
- learning algorithm