A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths.
S. Thomas McCormickScott R. SmallwoodFrits C. R. SpieksmaPublished in: Math. Oper. Res. (2001)
Keyphrases
- times faster
- dynamic programming
- improved algorithm
- computational complexity
- path planning
- learning algorithm
- high accuracy
- experimental evaluation
- np hard
- detection algorithm
- recognition algorithm
- significant improvement
- selection algorithm
- optimal solution
- k means
- computational cost
- convergence rate
- preprocessing
- linear programming
- polynomially bounded
- segmentation algorithm
- tree structure
- simulated annealing
- clustering method
- optimization algorithm
- computationally efficient
- particle swarm optimization
- input image
- multi objective
- data streams
- similarity measure
- feature selection