A bottom-up algorithm for finding minimal cut-sets of fault trees.
B. ClarkG. Reza-Latif-ShabgahiPublished in: Parallel and Distributed Computing and Networks (2004)
Keyphrases
- preprocessing
- learning algorithm
- computational complexity
- dynamic programming
- detection algorithm
- tree structure
- computational cost
- experimental evaluation
- times faster
- cost function
- high accuracy
- optimal solution
- optimization algorithm
- significant improvement
- probabilistic model
- expectation maximization
- segmentation algorithm
- similarity measure
- tree edit distance
- convergence rate
- improved algorithm
- matching algorithm
- classification algorithm
- theoretical analysis
- simulated annealing
- worst case
- np hard
- search space
- expert systems
- objective function