A Multiprocessor Algorithm for Merging Multiple Sorted Lists.
Peter J. VarmanBalakrishna R. IyerScott D. ScheuflerPublished in: ICPP (3) (1990)
Keyphrases
- preprocessing
- k means
- learning algorithm
- matching algorithm
- theoretical analysis
- experimental evaluation
- cost function
- dynamic programming
- convergence rate
- computational cost
- np hard
- improved algorithm
- computational complexity
- search space
- memory requirements
- particle swarm optimization
- computationally efficient
- merging algorithm
- tree structure
- data sets
- times faster
- multiprocessor architecture
- hardware implementation
- convex hull
- detection algorithm
- simulated annealing
- worst case
- lower bound
- data structure
- objective function
- similarity measure