1434 search results - page 38 / 287 » Distributed Computing with Imperfect Randomness |
FOCS
2010
IEEE
13 years 5 months ago
2010
IEEE
Complexity theory typically studies the complexity of computing a function h(x) : {0, 1}m {0, 1}n of a given input x. A few works have suggested to study the complexity of genera...
MOBIHOC
2006
ACM
14 years 7 months ago
2006
ACM
In this paper we revisit two classes of mobility models which are widely used to represent users' mobility in wireless networks: Random Waypoint (RWP) and Random Direction (R...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
We design efficient protocols for processors to extract private randomness over a network with Byzantine faults, when each processor has access to an independent weakly-random n-...
ISSTA
2006
ACM
14 years 1 months ago
2006
ACM
Test campaigns usually require only a restricted subset of paths in a program to be thoroughly tested. As random testing (RT) offers interesting fault-detection capacities at low ...
ICCAD
2004
IEEE
14 years 4 months ago
2004
IEEE
While process variations are becoming more significant with each new IC technology generation, they are often modeled via linear regression models so that the resulting performanc...