Disjoint Products and Efficient Computation of Reliability
From MaRDI portal
Recommendations
- Polynomially computable bounds for the probability of the union of events
- A survey of efficient reliability computation using disjoint products approach
- scientific article; zbMATH DE number 4048807
- Boolean Normal Forms, Shellability, and Reliability Computations
- Complexity of some graph-based bounds on the probability of a union of events
Cited in
(17)- Matroid Steiner problems, the Tutte polynomial and network reliability
- Heuristic testing procedures for general coherent systems
- Interior and exterior functions of positive Boolean functions.
- Approximate method to evaluate reliability of complex networks
- Interior and exterior functions of Boolean functions
- The reliability importance of components and prime implicants in coherent and non-coherent systems including total-order interactions
- Competitive Boolean function evaluation: beyond monotonicity, and the symmetric case
- Bayesian inference based on partial monitoring of components with applications to preventive system maintenance
- scientific article; zbMATH DE number 3896630 (Why is no real title available?)
- A survey of efficient reliability computation using disjoint products approach
- Tree-shellability of Boolean functions
- Competitive evaluation of threshold functions in the priced information model
- OBDDs of a monotone function and of its prime implicants
- Note on complexity of computing the domination of binary systems
- Simulation approach with MC-reduction for multi-state flow network reliability estimation
- Forms of representation for simple games: sizes, conversions and equivalences
- Heuristic least-cost computation of discrete classification functions with uncertain argument values
This page was built for publication: Disjoint Products and Efficient Computation of Reliability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3818100)
