657 search results - page 21 / 132 » Polynomial Time Algorithms for Minimum Energy Scheduling |
127
click to vote
FAW
2010
Springer
14 years 12 months ago
2010
Springer
We study the minimum diameter color-spanning set problem which has recently drawn some attention in the database community. We show that the problem can be solved in polynomial tim...
112
click to vote
ECCC
2006
14 years 11 months ago
2006
We focus on the problem of computing an -Nash equilibrium of a bimatrix game, when is an absolute constant. We present a simple algorithm for computing a 3 4 -Nash equilibrium for ...
COMPGEOM
2004
ACM
15 years 5 months ago
2004
ACM
We present a new algorithm for unfolding planar polygonal linkages without self-intersection based on following the gradient flow of a “repulsive” energy function. This algor...
127
click to vote
RTSS
2003
IEEE
15 years 5 months ago
2003
IEEE
This paper addresses the problem of scheduling realtime dwells in multi-function phase array radar systems. To keep track of targets, a radar system must meet its timing and energ...
108
click to vote
ECRTS
2004
IEEE
15 years 3 months ago
2004
IEEE
This paper targets energy-efficient scheduling of tasks over multiple processors, where tasks share a common deadline. Distinct from many research results on heuristics-based ener...