872 search results - page 39 / 175 » Extreme lower probabilities |
110
click to vote
CORR
2007
Springer
15 years 14 days ago
2007
Springer
—In the analysis of large random wireless networks, the underlying node distribution is almost ubiquitously assumed to be the homogeneous Poisson point process. In this paper, th...
121
Voted
ICDCN
2011
Springer
14 years 4 months ago
2011
Springer
Abstract. Wireless sensor networks (WSNs) deployed in hostile environments suffer from a high rate of node failure. We investigate the effect of such failure rate on network conn...
115
click to vote
VMCAI
2010
Springer
15 years 9 months ago
2010
Springer
This paper investigates relative precision and optimality of analyses for concurrent probabilistic systems. Aiming at the problem at the heart of probabilistic model checking ? com...
110
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
A strong direct product theorem (SDPT) states that solving n instances of a problem requires ˝.n/ times the resources for a single instance, even to achieve success probability 2 ...
122
Voted
STOC
2007
ACM
16 years 24 days ago
2007
ACM
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...