A Lower Bound for Nearly Minimal Adaptive and Hot Potato Algorithms.
Ishai Ben-AroyaDonald D. ChinnAssaf SchusterPublished in: Algorithmica (1998)
Keyphrases
- lower bound
- theoretical analysis
- orders of magnitude
- recently developed
- data structure
- significant improvement
- upper bound
- upper and lower bounds
- genetic algorithm
- neural network
- computational cost
- online algorithms
- adaptive algorithms
- average case
- lower and upper bounds
- times faster
- benchmark datasets
- computationally efficient
- linear programming
- worst case
- learning algorithm