735 search results - page 2 / 147 » Randomization in Parallel Stringology |
ECCC
2000
13 years 5 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 ...
RSA
1998
13 years 5 months ago
1998
It is well known that after placing n balls independently and uniformly at random into n bins, the fullest bin holds (logn=log logn) balls with high probability. Recently, Azar et...
MST
2000
13 years 5 months ago
2000
In this paper we present an efficient general simulation strategy for computations designed for fully operational BSP machines of n ideal processors, on n-processor dynamic-fault-p...
JPDC
1998
13 years 5 months ago
1998
CORR
2011
Springer
13 years 9 days ago
2011
Springer