A Pipelined Algorithm for Large, Irregular All-Gather Problems.
Jesper Larsson TräffAndreas RipkeChristian SiebertPavan BalajiRajeev ThakurWilliam GroppPublished in: Int. J. High Perform. Comput. Appl. (2010)
Keyphrases
- cost function
- np hard
- times faster
- dynamic programming
- experimental evaluation
- benchmark problems
- transportation problem
- objective function
- optimal solution
- detection algorithm
- learning algorithm
- clustering method
- combinatorial optimization
- convex hull
- worst case
- computational cost
- iterative algorithms
- computational complexity
- improved algorithm
- knapsack problem
- test problems
- larger problems
- matching algorithm
- ant colony optimization
- energy function
- np complete
- optimization problems
- path planning
- expectation maximization
- simulated annealing
- recognition algorithm
- high accuracy
- probabilistic model
- preprocessing
- similarity measure
- neural network