5580 search results - page 338 / 1116 » Randomized priority algorithms |
173
click to vote
ICALP
2001
Springer
15 years 11 months ago
2001
Springer
In contrast to classical offline k-k routing, the online packet routing problem allows for an arbitrary number of packets with arbitrary end points and release times. We study this...
156
click to vote
ECRTS
1999
IEEE
15 years 11 months ago
1999
IEEE
Scheduling time impact on system performance increases especially when using dynamic priority algorithms, because of the enlarged computational effort at runtime. This overhead ca...
199
click to vote
ANOR
2010
15 years 4 months ago
2010
We present a methodology to automatically generate an online job scheduling method for a custom-made objective and real workloads. The scheduling problem comprises independent para...
162
Voted
FOCS
1999
IEEE
15 years 11 months ago
1999
IEEE
We present a randomized algorithm for computing portions of an arrangement of n arcs in the plane, each pair of which intersect in at most t points. We use this algorithm to perfo...
201
click to vote
SODA
2001
ACM
15 years 8 months ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...