A 3/2-Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks.
Gregory MounieChristophe RapineDenis TrystramPublished in: SIAM J. Comput. (2007)
Keyphrases
- k means
- detection algorithm
- learning algorithm
- high accuracy
- optimal solution
- computational cost
- expectation maximization
- improved algorithm
- error bounds
- preprocessing
- experimental evaluation
- scheduling strategy
- matching algorithm
- segmentation algorithm
- worst case
- scheduling problem
- np hard
- computational complexity
- computationally efficient
- theoretical analysis
- cost function
- tree structure
- significant improvement
- closed form
- recognition algorithm
- search algorithm
- parallel processors
- similarity measure