A tighter bound for the self-stabilization time in Herman's algorithm.
Yuan FengLijun ZhangPublished in: Inf. Process. Lett. (2013)
Keyphrases
- worst case
- experimental evaluation
- np hard
- cost function
- learning algorithm
- computational complexity
- improved algorithm
- high accuracy
- search space
- detection algorithm
- times faster
- error bounds
- segmentation algorithm
- theoretical analysis
- optimization algorithm
- particle swarm optimization
- linear programming
- selection algorithm
- genetic algorithm
- upper bound
- computational cost
- similarity measure
- simulated annealing
- significant improvement
- k means
- computationally efficient
- lower bound
- preprocessing
- optimal solution
- objective function
- path planning
- reinforcement learning
- feature selection
- data sets
- estimation error