The idea of the linear time algorithm, as a very efficient and compact modules detecting algorithm, is visiting the nodes one by one with top-down depth-first left-most traversal of the tree.
So the efficiency of the linear time algorithm is limited by nodes visiting time successively and serially, especially when confronting large-scale fault trees. Aiming at improving the efficiency of modularizing largescale fault trees, this paper proposes a new parallel method to find all possible modules. Firstly, we transform the fault tree into a directed acyclic graph DAG and treat the terminal basic nodes as entries of the algorithm.
And then, according to the proposed rules in this paper, we traverse the graph bottom-up from the terminal nodes and mark the internal nodes in a parallel way. Jong Hyuk Park , Albert Zomaya , et al.
Books by Hong Shen
Kindle Edition. Jong Hyuk Park , Hai Jin , et al.
- James J. (Jong Hyuk) Park!
- Milton and the Baroque.
- Data analysis with Mplus?
- Sexualities: Past Reflections, Future Directions;
- Guerraoui, Rachid (1967-....).
Get it by Monday, October Jong Hyuk Park , Gangman Yi , et al. Get it by Thursday, October Only 1 left in stock.
James J. (Jong Hyuk) Park eBooks (Page 3) - enreavenpang.tk
Park , Laurence T. Yang , et al.
- Young-Sik Jeong: Buy Online from enreavenpang.tk;
- Photo .
- The Digital Plague (Avery Cates, Book 2)!
- BE THE FIRST TO KNOW!
- Søk [sikes] » Bokkilden.
- Painted Fans of Japan: 15 Noh Drama Masterpieces.
- Managing Risk and Resilience in the Supply Chain.
Get it Saturday, October 5 - Sunday, October Jong Hyuk Park , Ivan Stojmenovic , et al. Get it Saturday, September 28 - Monday, September Park , Doo-Soon Park , et al.
Currently unavailable. Jong Hyuk Park , Leonard Barolli , et al.
Onion.ly Tor2Web Proxy
Go back to filtering menu. Tell us how we can improve If you need help, please visit the help section or contact us. Submit Please provide a response.