SOFSEM
2012
Springer
12 years 4 days ago
2012
Springer
The classical group testing problem asks to determine at most d defective elements in a set of n elements, by queries to subsets that return Yes if the subset contains some defecti...
ICDCS
2011
IEEE
12 years 4 months ago
2011
IEEE
—The number of real-world applications that require QoS guarantees is constantly increasing and they often follow the publish/subscribe (pub/sub) messaging paradigm, which provid...
PLDI
2011
ACM
12 years 7 months ago
2011
ACM
Fixing software bugs has always been an important and timeconsuming process in software development. Fixing concurrency bugs has become especially critical in the multicore era. H...
ICDCN
2011
Springer
12 years 8 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...
INFOCOM
2010
IEEE
13 years 3 months ago
2010
IEEE
—We consider network reliability in layered networks where the lower layer experiences random link failures. In layered networks, each failure at the lower layer may lead to mult...
PPL
2000
13 years 4 months ago
2000
In this paper we analyze the computational power of random geometric networks in the presence of random (edge or node) faults considering several important network parameters. We ...
MJ
2006
13 years 4 months ago
2006
A novel method (the V-shaped curve) is presented to predict the failure probability of anisotropic conductive film (ACF) in IC/substrate assemblies. The Poisson function is used t...
WCE
2007
13 years 5 months ago
2007
—The methodologies to calculate failure probability and to estimate the reliability of fatigue loaded structures are developed. The applicability of the methodologies is evaluate...
ITSL
2008
13 years 6 months ago
2008
In this paper we present a randomized complexity theoretic model for those epidemics propagated via short-distance close contact. We prove that the contact-based epidemics problems...
PODC
2005
ACM
13 years 10 months ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...