854 search results - page 118 / 171 » Abstracting from Failure Probabilities |
130
Voted
ISCA
2010
IEEE
15 years 9 months ago
2010
IEEE
Fault tolerance is now a primary design constraint for all major microprocessors. One step in determining a processor’s compliance to its failure rate target is measuring the Ar...
172
click to vote
ICPP
1999
IEEE
15 years 9 months ago
1999
IEEE
The probability of failures in software distributed shared memory (SDSM) increases as the system size grows. This paper introduces a new, efficient message logging technique, call...
126
click to vote
STOC
1997
ACM
15 years 9 months ago
1997
ACM
We examine a class of collective coin- ipping games that arises from randomized distributed algorithms with halting failures. In these games, a sequence of local coin ips is gener...
134
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We study efficient importance sampling techniques for particle filtering (PF) when either (a) the observation likelihood (OL) is frequently multimodal or heavy-tailed, or (b) the s...
158
click to vote
KDD
2004
ACM
16 years 5 months ago
2004
ACM
We propose a new unsupervised learning technique for extracting information from large text collections. We model documents as if they were generated by a two-stage stochastic pro...