2084 search results - page 205 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
167
Voted
DIALM
2003
ACM
15 years 7 months ago
2003
ACM
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
127
click to vote
SAC
2006
ACM
15 years 8 months ago
2006
ACM
: In chip design, one of the main objectives is to decrease its clock cycle; however, the existing approaches to timing analysis under uncertainty are based on fundamentally restri...
113
click to vote
ICRA
2007
IEEE
15 years 8 months ago
2007
IEEE
— We explore an on-line problem where a group of robots has to reach a target whose position is known in an unknown planar environment whose geometry is acquired by the robots du...
128
Voted
ICS
2010
Tsinghua U.
15 years 12 months ago
2010
Tsinghua U.
In this paper we study the possibility of proving the existence of one-way functions based on average case hardness. It is well-known that if there exists a polynomial-time sample...
133
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...