1612 search results - page 11 / 323 » Analysing Randomized Distributed Algorithms |
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.
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
Random projection methods give distributions over k
IPSN
2003
Springer
14 years 16 days ago
2003
Springer
Abstract. We present a distributed algorithm for environmental monitoring of a scalar field (such as temperature, intensity of light, atmospheric pressure, etc.) using a random se...
OL
2011
13 years 2 months ago
2011
We demonstrate that the Linear Multidimensional Assignment Problem with iid random costs is polynomially "-approximable almost surely (a. s.) via a simple greedy heuristic, f...
IJCCBS
2010
13 years 5 months ago
2010
: True random number generators (TRNGs) are extensively used in cryptography, simulations and statistics. In this work, we introduce, extend and analyse the concept of the randomis...