2084 search results - page 110 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
109
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely u...
139
Voted
COMPGEOM
2008
ACM
15 years 4 months ago
2008
ACM
We study the problem of two-dimensional Delaunay triangulation in the self-improving algorithms model [1]. We assume that the n points of the input each come from an independent, ...
IJCGA
2007
15 years 2 months ago
2007
We study the expected size of the 2D visibility complex of randomly distributed objects in the plane. We prove that the asymptotic expected number of free bitangents (which corres...
146
Voted
HYBRID
2009
Springer
15 years 9 months ago
2009
Springer
In this paper, we analyze the problem of finding a periodic schedule for the wake-up times of a set of nodes in a Wireless Sensor Network that optimizes the coverage of the region...
133
Voted
JCO
2008
15 years 2 months ago
2008
The problem of partitioning a partially ordered set into a minimum number of chains is a well-known problem. In this paper we study a generalization of this problem, where we not ...