A fully scalable algorithm suited for petascale computing and beyond.
Juan A. AcebrónÁngel Rodríguez-RozasRenato SpiglerPublished in: Comput. Sci. Res. Dev. (2010)
Keyphrases
- dynamic programming
- improved algorithm
- computational complexity
- learning algorithm
- optimal solution
- computational cost
- np hard
- single pass
- times faster
- optimization algorithm
- theoretical analysis
- search space
- cost function
- data sets
- highly efficient
- experimental study
- particle swarm optimization
- input data
- particle filter
- k means
- linear programming
- clustering method
- simulated annealing
- classification algorithm
- matching algorithm
- preprocessing
- memory requirements
- convergence rate
- search algorithm
- probabilistic model
- experimental evaluation