2084 search results - page 389 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
INFOCOM
2006
IEEE
15 years 3 months ago
2006
IEEE
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
CISS
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract— We consider the network control problem for wireless networks with flow level dynamics under the general k-hop interference model. In particular, we investigate the co...
ISAAC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
LICS
2000
IEEE
15 years 2 months ago
2000
IEEE
We consider two-player games which are played on a finite state space for an infinite number of rounds. The games are concurrent, that is, in each round, the two players choose ...
COCO
2005
Springer
14 years 11 months ago
2005
Springer
We exhibit an explicitly computable ‘pseudorandom’ generator stretching l bits into m(l) = lΩ(log l) bits that look random to constant-depth circuits of size m(l) with log m...