657 search results - page 3 / 132 » Polynomial Time Algorithms for Minimum Energy Scheduling |
DAM
2006
13 years 11 months ago
2006
Let P be a combinatorial optimization problem, and let A be an approximation algorithm for P. The domination ratio domr(A, s) is the maximal real q such that the solution x(I) obt...
GLVLSI
2003
IEEE
14 years 4 months ago
2003
IEEE
This paper first presents an accurate and efficient method of estimating the short circuit energy dissipation and the output transition time of CMOS buffers. Next the paper descri...
DAC
1997
ACM
14 years 2 months ago
1997
ACM
This paper presents for the first time low energy simultaneous memory and register allocation. A minimum cost network flow approach is used to efficiently solve for minimum energy...
COCOON
2005
Springer
14 years 4 months ago
2005
Springer
Westudyjobschedulingonprocessorscapableofrunningatvariablevoltage/speed tominimizeenergyconsumption.Eachjob ina probleminstanceisspecifiedbyitsarrivaltime and deadline, together w...
SOFSEM
2007
Springer
14 years 5 months ago
2007
Springer
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...