A lower bound on mean delay for free access class of RMA algorithms.
Andrey M. TurlikovSergey D. AndreevPublished in: ICT (2008)
Keyphrases
- lower bound
- worst case
- computationally efficient
- learning algorithm
- data structure
- significant improvement
- lower and upper bounds
- computational complexity
- upper and lower bounds
- upper bound
- optimization problems
- theoretical analysis
- benchmark datasets
- online algorithms
- sample complexity
- integer programming
- decision support system
- simulated annealing
- computational cost
- objective function