NP-Completeness of the Bulk Synchronous Task Scheduling Problem and Its Approximation Algorithm.
Noriyuki FujimotoKenichi HagiharaPublished in: ISPAN (2000)
Keyphrases
- np hard
- times faster
- preprocessing
- scheduling problem
- optimal solution
- matching algorithm
- detection algorithm
- dynamic programming
- computational cost
- closed form
- cost function
- high accuracy
- simulated annealing
- expectation maximization
- optimization algorithm
- approximation ratio
- monte carlo
- improved algorithm
- k means
- segmentation algorithm
- theoretical analysis
- particle swarm optimization
- input data
- worst case
- lower bound
- objective function
- learning algorithm