657 search results - page 17 / 132 » Polynomial Time Algorithms for Minimum Energy Scheduling |
ESA
2009
Springer
15 years 6 months ago
2009
Springer
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
104
click to vote
ECRTS
2005
IEEE
15 years 5 months ago
2005
IEEE
Slowdown based on dynamic voltage scaling (DVS) provides the ability to perform an energy-delay tradeoff in the system. Non-preemptive scheduling becomes an integral part of syste...
107
click to vote
ESA
1999
Springer
15 years 4 months ago
1999
Springer
We give a polynomial approximation scheme for the problem of scheduling on uniformly related parallel machines for a large class of objective functions that depend only on the mac...
108
click to vote
SODA
1992
ACM
15 years 27 days ago
1992
ACM
We show that the length of the minimum weight Steiner triangulation (MWST) of a point set can be approximated within a constant factor by a triangulation algorithm based on quadtr...
114
click to vote
VLSID
2003
IEEE
16 years 3 days ago
2003
IEEE
In this paper, we describe two new algorithms for datapath scheduling which aim at energy reduction while maintaining performance. The proposed algorithms, time constrained and re...