On the additive constant of the k-server Work Function Algorithm.
Yuval EmekPierre FraigniaudAmos KormanAdi RosénPublished in: Inf. Process. Lett. (2010)
Keyphrases
- learning algorithm
- computational cost
- optimization algorithm
- computational complexity
- preprocessing
- improved algorithm
- k means
- dynamic programming
- experimental evaluation
- classification algorithm
- worst case
- input data
- particle swarm optimization
- estimation algorithm
- expectation maximization
- simulated annealing
- optimal solution
- computationally efficient
- segmentation algorithm
- tree structure
- probabilistic model
- matching algorithm
- path planning
- memory requirements
- convergence rate
- recognition algorithm
- search space