657 search results - page 39 / 132 » Polynomial Time Algorithms for Minimum Energy Scheduling |
168
click to vote
ISSS
2002
IEEE
15 years 4 months ago
2002
IEEE
This paper addresses the problem of mapping an application, which is highly dynamic in the future, onto a heterogeneous multiprocessor platform in an energy efficient way. A two-p...
ICTCS
2005
Springer
15 years 5 months ago
2005
Springer
We study the effect of laxity, or slack time, on the online scheduling of broadcasts with deadlines. The laxity of a request is defined to be the ratio between its span (differe...
ESA
2009
Springer
15 years 6 months ago
2009
Springer
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
104
click to vote
RTAS
2005
IEEE
15 years 5 months ago
2005
IEEE
We consider the problem of energy minimization for periodic preemptive hard real-time tasks that are scheduled on an identical multiprocessor platform with dynamic voltage scaling...
114
click to vote
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
In the independent component analysis, polynomial functions of higher order statistics are often used as cost functions. However, such cost functions usually have many local minim...