Analysis of an Approximation Algorithm for Scheduling Independent Parallel Tasks.
Keqin LiPublished in: Discret. Math. Theor. Comput. Sci. (1999)
Keyphrases
- learning algorithm
- preprocessing
- times faster
- experimental evaluation
- detection algorithm
- computational complexity
- k means
- worst case
- convex hull
- polynomial time approximation
- parallel implementation
- expectation maximization
- optimal solution
- objective function
- optimization algorithm
- cost function
- multi objective
- error bounds
- recognition algorithm