A New Deterministic Parallel Sorting Algorithm with an Experimental Evaluation.
David R. HelmanJoseph F. JáJáDavid A. BaderPublished in: ACM J. Exp. Algorithmics (1998)
Keyphrases
- experimental evaluation
- dynamic programming
- detection algorithm
- significant improvement
- objective function
- parallel implementation
- computational complexity
- preprocessing
- k means
- np hard
- computational cost
- worst case
- convex hull
- selection algorithm
- improved algorithm
- hardware implementation
- synthetic and real datasets
- search space
- randomized algorithm
- sorting algorithms
- linear programming
- convergence rate
- times faster
- matching algorithm
- segmentation algorithm
- particle swarm optimization
- simulated annealing
- cost function
- optimal solution