Opening book details…
Can I read Algorithms for analyzing the probability of M-out-of-N events on EtoBox?
Algorithms for analyzing the probability of M-out-of-N events by F.Eric Haskin; George E. Radke Jr.; Javon Evanoff is a Engineering article available to read on EtoBox.
What is Algorithms for analyzing the probability of M-out-of-N events about?
Simple algorithms are presented to compute both the exact probability of M or more out of N independent input events given unequal probabilities and, when there is uncertainty in the input event probabilities, the associated variance in the M-out-of-N probability. The performance of the M-out-of-N probability algorithm is on the order of N 2 in time and N in space. The performance of the variance algorithm is N 3 in time and N 2 in space. The algorithms are not based on cut set methodology and, consequently, are not limited by the combinatorial explosion associated with cut set manipulation for the M-out-of-N gate. The algorithms are most useful when N exceeds the limitations of cut set manipulation techniques or the M-out-of-N probability is between 0.1 and l, such that approximate quantification methods are inaccurate. In addition, the M-out-of-N probability is extended to permit the quantification of standard sensitivity and uncertainty importance measures for both individual input events and groups of input events. Example calculations illustrate the capabilities of the algorithms.
Who reads Algorithms for analyzing the probability of M-out-of-N events?
It is typically read by researchers, students, and practitioners in Engineering.
- Author
- F.Eric Haskin; George E. Radke Jr.; Javon Evanoff
- Publisher
- Elsevier Science; Elsevier ; Elsevier BV (ISSN 0951-8320)
- Published
- 1995
- Language
- EN
- Field
- Engineering (Physical Sciences)
More by F.Eric Haskin; George E. Radke Jr.; Javon Evanoff
Browse all works by F.Eric Haskin; George E. Radke Jr.; Javon Evanoff