A Strongly Competitive Randomized Paging Algorithm.
Lyle A. McGeochDaniel Dominic SleatorPublished in: Algorithmica (1991)
Keyphrases
- monte carlo
- computational complexity
- optimization algorithm
- np hard
- improved algorithm
- objective function
- cost function
- theoretical analysis
- worst case
- search space
- k means
- dynamic programming
- recognition algorithm
- genetic algorithm
- ant colony optimization
- expectation maximization
- experimental evaluation
- significant improvement
- preprocessing
- selection algorithm
- data sets
- convergence rate
- times faster
- path planning
- competitive ratio
- matching algorithm
- segmentation method
- segmentation algorithm
- computationally efficient
- high accuracy
- input image
- support vector machine
- computational cost