A nearly optimal upper bound for the self-stabilization time in Herman's algorithm.
Yuan FengLijun ZhangPublished in: Distributed Comput. (2015)
Keyphrases
- worst case
- upper bound
- dynamic programming
- detection algorithm
- optimal solution
- optimization algorithm
- computational cost
- high accuracy
- times faster
- k means
- np hard
- globally optimal
- linear programming
- improved algorithm
- matching algorithm
- recognition algorithm
- theoretical analysis
- optimal path
- weighting coefficients
- segmentation algorithm
- learning algorithm
- expectation maximization
- experimental evaluation
- objective function
- clustering method
- computationally efficient
- path planning
- closed form
- simulated annealing
- probabilistic model
- optimal strategy
- search space
- regret bounds
- error probability