2714 search results - page 88 / 543 » Approximation Schemes for Scheduling |
101
Voted
ICC
2009
IEEE
15 years 10 months ago
2009
IEEE
—A new variation of the Flow-Aware Networking (FAN) concept is presented in the paper. The proposed solution is based on the Approximate Fair Dropping algorithm and called by us ...
118
click to vote
STOC
2002
ACM
16 years 3 months ago
2002
ACM
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...
125
Voted
ICC
2008
IEEE
15 years 10 months ago
2008
IEEE
— Scheduling in an ad hoc wireless network suffers from the non-convexity of the cost function, caused by the interference between communication links. In previous optimization t...
157
Voted
HIPC
2007
Springer
15 years 7 months ago
2007
Springer
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
178
Voted
FODO
1998
Springer
15 years 7 months ago
1998
Springer
In this study we present a scheme called two-dimensional BubbleUp (2DB) for managing parallel disks in a multimedia server. Its goal is to reduce initial latency for interactive m...