517 search results - page 52 / 104 » Approximation Algorithms for Scheduling with Reservations |
121
Voted
EUROCAST
2007
Springer
15 years 9 months ago
2007
Springer
In the context of Intelligent Transportation Systems based on driverless vehicles, one important issue is the passing of a crossroads. This paper presents a supervised reservation ...
124
click to vote
IPCO
1998
15 years 4 months ago
1998
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
127
Voted
FOCS
2000
IEEE
15 years 7 months ago
2000
IEEE
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
102
Voted
TPDS
2008
15 years 3 months ago
2008
We consider the Continuous Delivery Message Dissemination (CDMD) problem over the n-processor single-port complete (all links are present and are bidirectional) static network with...
169
click to vote
WADS
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...