Quicksort Algorithm Again Revisited.
Charles KnesslWojciech SzpankowskiPublished in: Discret. Math. Theor. Comput. Sci. (1999)
Keyphrases
- theoretical analysis
- preprocessing
- significant improvement
- similarity measure
- computational complexity
- search space
- cost function
- times faster
- single pass
- detection algorithm
- matching algorithm
- estimation algorithm
- optimal solution
- convergence rate
- improved algorithm
- ant colony optimization
- energy function
- expectation maximization
- computationally efficient
- simulated annealing
- high accuracy
- scheduling problem
- path planning
- machine learning
- space complexity
- experimental evaluation
- computational cost
- state space
- memory requirements
- convex hull
- data sets
- semi supervised
- segmentation method
- experimental study
- linear programming
- particle swarm optimization