Significant Improvements to the Ford-Johnson Algorithm for Sorting.
Tien Dai BuiMai ThanhPublished in: BIT (1985)
Keyphrases
- significant improvement
- experimental evaluation
- preprocessing
- times faster
- computational complexity
- high accuracy
- search space
- k means
- np hard
- detection algorithm
- worst case
- neural network
- learning algorithm
- cost function
- dynamic programming
- evolutionary algorithm
- improved algorithm
- objective function
- theoretical analysis
- optimization algorithm
- single pass
- convex hull
- path planning
- ant colony optimization
- sorting algorithms
- experimental study
- expectation maximization
- linear programming
- simulated annealing
- probabilistic model
- computational cost
- multi objective
- bayesian networks