14 search results - page 1 / 3 » A new lower bounding scheme for the total weighted tardiness... |
COR
1998
13 years 6 months ago
1998
ECRTS
2005
IEEE
14 years 21 days ago
2005
IEEE
We consider the use of the earliest-deadline-first (EDF) scheduling algorithm in soft real-time multiprocessor systems. In hard real-time systems, a significant disparity exists...
ESA
2005
Springer
14 years 18 days ago
2005
Springer
Abstract. We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are re...
STOC
2007
ACM
14 years 7 months ago
2007
ACM
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
COCOON
2007
Springer
14 years 1 months ago
2007
Springer
We consider the problem of scheduling a set of equal-length intervals arriving online, where each interval is associated with a weight and the objective is to maximize the total we...