1434 search results - page 23 / 287 » Distributed Computing with Imperfect Randomness |
FGCS
2006
13 years 7 months ago
2006
We consider a model where commodity service providers are offering commodity computational services to a set of customers. We provide a solution for the efficient distribution of ...
GLOBECOM
2008
IEEE
14 years 2 months ago
2008
IEEE
— The aggregate capacity of wireless ad-hoc networks can be substantially increased if each wireless node is equipped with multiple network interface cards (NICs) and each NIC op...
SPAA
1993
ACM
13 years 11 months ago
1993
ACM
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.
BMCBI
2005
13 years 7 months ago
2005
Background: The inference of homology from statistically significant sequence similarity is a central issue in sequence alignments. So far the statistical distribution function un...
MOBIHOC
2006
ACM
14 years 7 months ago
2006
ACM
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...