An Efficient BSP/CGM Algorithm for the Matrix Chain Ordering Problem.
Mounir KechidJean Frédéric MyoupoPublished in: PDPTA (2008)
Keyphrases
- optimization algorithm
- similarity measure
- computationally efficient
- times faster
- high accuracy
- dynamic programming
- np hard
- computational complexity
- k means
- significant improvement
- learning algorithm
- detection algorithm
- experimental evaluation
- search space
- objective function
- improved algorithm
- worst case
- preprocessing
- expectation maximization
- theoretical analysis
- neural network
- path planning
- binary tree
- recognition algorithm
- distance matrix
- transformation matrix
- matching algorithm
- simulated annealing
- mobile robot
- multiresolution
- lower bound
- optimal solution
- feature selection