99 search results - page 4 / 20 » Approximation algorithms and hardness of integral concurrent... |
120
click to vote
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
We resolve an open question raised by Feige & Scheideler by showing that the best known approximation algorithm for flow shops is essentially tight with respect to the used low...
110
click to vote
RANDOM
2001
Springer
15 years 6 months ago
2001
Springer
We study integrated prefetching and caching in single and parallel disk systems. A recent approach used linear programming to solve the problem. We show that integrated prefetching...
105
click to vote
RTCSA
2000
IEEE
15 years 5 months ago
2000
IEEE
We propose an efficient strategy for resource management for scalable QoS guaranteed real-time communication services. This strategy is based on sink trees, and is particularly we...
133
click to vote
ICC
2000
IEEE
15 years 6 months ago
2000
IEEE
As the Internet transforms from the traditional best-effort service network into QoS-capable multi-service network, it is essential to have new architectural design and appropriate...
113
Voted
ECCC
2006
15 years 1 months ago
2006
Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...