Scheduling unit tasks to minimize the number of idle periods: a polynomial time algorithm for offline dynamic power management.
Philippe BaptistePublished in: SODA (2006)
Keyphrases
- computational complexity
- learning algorithm
- objective function
- k means
- worst case
- randomized algorithm
- detection algorithm
- optimal solution
- preprocessing
- polynomial time complexity
- np hard
- dynamic programming
- segmentation algorithm
- memory requirements
- query complexity
- database
- genetic algorithm
- scheduling problem
- approximation ratio
- strongly polynomial
- scheduling algorithm
- power consumption
- particle swarm optimization
- special case
- databases