Sciweavers

1434 search results - page 9 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
IPPS
1996
IEEE
13 years 11 months ago
Practical Algorithms for Selection on Coarse-Grained Parallel Computers
In this paper, we consider the problem of selection on coarse-grained distributed memory parallel computers. We discuss several deterministic and randomized algorithms for paralle...
Ibraheem Al-Furaih, Srinivas Aluru, Sanjay Goil, S...
IPPS
1998
IEEE
13 years 11 months ago
Random Sampling Techniques in Parallel Computation
Abstract. Random sampling is an important tool in the design of parallel algorithms. Using random sampling it is possible to obtain simple parallel algorithms which are e cient in ...
Rajeev Raman
AAAI
1996
13 years 8 months ago
A Clinician's Tool for Analyzing Non-Compliance
We describe a computer program to assist a clinician with assessing the e cacy of treatments in experimental studies for which treatment assignment is random but subject complianc...
David Maxwell Chickering, Judea Pearl