A Nearly Optimal Upper Bound for the Self-Stabilization Time in Herman's Algorithm.
Yuan FengLijun ZhangPublished in: CONCUR (2014)
Keyphrases
- worst case
- upper bound
- dynamic programming
- experimental evaluation
- optimal solution
- times faster
- learning algorithm
- cost function
- theoretical analysis
- preprocessing
- globally optimal
- optimization algorithm
- detection algorithm
- computational cost
- closed form
- computationally efficient
- recognition algorithm
- computational complexity
- particle swarm optimization
- simulated annealing
- segmentation algorithm
- efficiently computable
- k means
- improved algorithm
- optimal cost
- weighting coefficients
- linear programming
- tree structure
- np hard
- multi objective
- significant improvement
- objective function