657 search results - page 46 / 132 » Polynomial Time Algorithms for Minimum Energy Scheduling |
100
click to vote
WG
2004
Springer
15 years 5 months ago
2004
Springer
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...
101
click to vote
IPPS
2005
IEEE
15 years 5 months ago
2005
IEEE
Enabling high performance, persistent mobile computing has recently become a very active research area. The widespread popularity of mobile computing devices, such as laptops, han...
105
click to vote
ICCAD
1995
IEEE
15 years 3 months ago
1995
IEEE
Implementing a built-in self-test by a "test per clock" scheme offers advantages concerning fault coverage, detection of delay faults, and test application time. Such a ...
116
click to vote
ECCV
2002
Springer
16 years 1 months ago
2002
Springer
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs...
104
click to vote
CORR
2011
Springer
14 years 3 months ago
2011
Springer
Scheduling applications on wide-area distributed systems is useful for obtaining quick and reliable results in an efficient manner. Optimized scheduling algorithms are fundamental...