Sciweavers

13752 search results - page 272 / 2751
» Parallel and Distributed Haskells
Sort
View
SPAA
1993
ACM
15 years 10 months ago
On Gazit and Miller's Parallel Algorithm for Planar Separators: Achieving Greater Efficiency Through Random Sampling
We show how to obtain a work-efficient parallel algorithm for finding a planar separator. The algorithm requires O(rz’ ) time for any given positive constant e.
Philip N. Klein
IPPS
2009
IEEE
16 years 1 months ago
Folding@home: Lessons from eight years of volunteer distributed computing
Adam L. Beberg, Daniel L. Ensign, Guha Jayachandra...
EUROPAR
2009
Springer
16 years 1 months ago
Distributed Individual-Based Simulation
Jiming Liu, Michael B. Dillencourt, Lubomir F. Bic...
IPPS
2008
IEEE
16 years 1 months ago
Optimizing the data distribution layer of BOINC with BitTorrent
Fernando Costa, Luís Moura Silva, Ian Kelle...