657 search results - page 44 / 132 » Polynomial Time Algorithms for Minimum Energy Scheduling |
EURODAC
1995
IEEE
15 years 3 months ago
1995
IEEE
This paper presents a novel approach to scheduling of hardware supported synchronization operations. The optimization goal is to minimize the interation time of processes and thus...
ISCAS
2005
IEEE
15 years 5 months ago
2005
IEEE
In high-level synthesis, accurate lower-bound estimation is helpful to explore the search space efficiently and to evaluate the quality of heuristic algorithms. For the lower-bound...
RTS
2006
14 years 11 months ago
2006
Timing constraints for radar tasks are usually specified in terms of the minimum and maximum temporal distance between successive radar dwells. We utilize the idea of feasible int...
104
click to vote
DEXA
2010
Springer
14 years 12 months ago
2010
Springer
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
FOCS
1992
IEEE
15 years 3 months ago
1992
IEEE
Consider a convex set P in IRd and a piecewise polynomial concave function F: P IR. Let A be an algorithm that given a point x IRd computes F(x) if x P, or returns a concave po...