Pages that link to "Item:Q3189067"
From MaRDI portal
The following pages link to Polynomial-time algorithms for minimum energy scheduling (Q3189067):
Displayed 9 items.
- A survey of offline algorithms for energy minimization under deadline constraints (Q283261) (← links)
- Power and performance management for parallel computations in clouds and data centers (Q896015) (← links)
- Scheduling with gaps: new models and algorithms (Q2059088) (← links)
- A fully polynomial-time approximation scheme for speed scaling with a sleep state (Q2319643) (← links)
- A greedy approximation algorithm for minimum-gap scheduling (Q2400437) (← links)
- Race to idle (Q5501963) (← links)
- Minimizing the cost of batch calibrations (Q5918836) (← links)
- Minimizing energy on homogeneous processors with shared memory (Q5925517) (← links)
- An \(O(n^3)\)-time algorithm for the min-gap unit-length job scheduling problem (Q6168970) (← links)