608 search results - page 10 / 122 » On Dependent Randomized Rounding Algorithms |
JEA
1998
13 years 7 months ago
1998
We introduce a new deterministic parallel sorting algorithm based on the regular sampling approach. The algorithm uses only two rounds of regular all-to-all personalized communica...
SIGAL
1990
13 years 11 months ago
1990
We propose and analyse a quasirandom analogue to the classical push model for disseminating information in networks ("randomized rumor spreading"). In the classical mode...
ECCC
2000
13 years 7 months ago
2000
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
INFOCOM
2000
IEEE
13 years 12 months ago
2000
IEEE
Abstract—We investigate the performance of TCP under three representatives of packet scheduling algorithms at the router. Our main focus is to investigate how fair service can be...
SIAMCOMP
1998
13 years 7 months ago
1998
We present a consensus algorithm that combines unreliable failure detection and randomization, two well-known techniques for solving consensus in asynchronous systems with crash f...