657 search results - page 12 / 132 » Polynomial Time Algorithms for Minimum Energy Scheduling |
178
Voted
GLVLSI
2006
IEEE
15 years 12 months ago
2006
IEEE
Dynamic voltage scaling (DVS) for real-time systems has been extensively studied to save energy. Previous studies consider the probabilistic distributions of tasks’ execution ti...
142
click to vote
IPL
2002
15 years 5 months ago
2002
We study the problem of scheduling unit time tasks of two types on m parallel identical machines. For each type, given numbers of tasks are required to be completed by the specifi...
151
click to vote
FOCS
2008
IEEE
16 years 9 days ago
2008
IEEE
In the classic minimum makespan scheduling problem, we are given an input sequence of jobs with processing times. A scheduling algorithm has to assign the jobs to m parallel machi...
140
click to vote
STOC
1995
ACM
15 years 9 months ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
159
click to vote
PAMI
2010
15 years 4 months ago
2010
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...