Fault Probability Evaluation in DESs with an Algorithm of Linear Complexity and Partially Observed SPNs.
Dimitri LefebvrePublished in: WODES (2014)
Keyphrases
- linear complexity
- experimental evaluation
- learning algorithm
- objective function
- computational cost
- times faster
- partially observed
- optimization algorithm
- cost function
- significant improvement
- k means
- preprocessing
- computational complexity
- recognition algorithm
- np hard
- dynamic programming
- computationally efficient
- improved algorithm
- probabilistic model
- clustering algorithm
- data sets