An adaptive generic sorting algorithm that uses variable partitioning.
Vladimir Estivill-CastroDerick WoodPublished in: Int. J. Comput. Math. (1996)
Keyphrases
- preprocessing
- times faster
- theoretical analysis
- optimal solution
- search space
- experimental evaluation
- objective function
- matching algorithm
- cost function
- np hard
- probabilistic model
- high accuracy
- improved algorithm
- data sets
- optimization algorithm
- linear programming
- dynamic programming
- k means
- computational complexity
- worst case
- computational cost
- input data
- expectation maximization
- clustering method
- path planning
- search algorithm
- memory requirements
- convergence rate
- learning algorithm