A divide and conquer algorithm for DAG scheduling under power constraints.
Gökalp DemirciIvana MarincicHenry HoffmannPublished in: SC (2018)
Keyphrases
- times faster
- computational cost
- detection algorithm
- recognition algorithm
- cost function
- experimental evaluation
- expectation maximization
- constrained optimization
- computational complexity
- np hard
- segmentation algorithm
- high accuracy
- optimization algorithm
- dynamic programming
- k means
- matching algorithm
- clustering method
- tree structure
- simulated annealing
- preprocessing
- neural network
- combinatorial optimization
- geometric constraints
- multiple constraints
- input data
- worst case
- significant improvement
- optimal solution
- objective function
- learning algorithm