1806 search results - page 148 / 362 » Randomness and halting probabilities |
ESA
2011
Springer
12 years 10 months ago
2011
Springer
We present a number of positive and negative results for variants of the matroid secretary problem. Most notably, we design a constant-factor competitive algorithm for the “rando...
INFOCOM
2007
IEEE
14 years 4 months ago
2007
IEEE
We consider the problem of reliable broadcast in a wireless network in which nodes are prone to failure. In the failure mode considered in this paper, each node can fail independe...
SODA
2007
ACM
13 years 11 months ago
2007
ACM
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
ICDE
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...
ICPADS
2005
IEEE
14 years 3 months ago
2005
IEEE
Peer-to-Peer (P2P) applications typically use overlay networks to forward the content queries. However, due to the distributed fashion of the overlay establishment, the overlay ne...