本文讨论一种非正则的评价函数和它的最优化的一种准则，给出在这种准则下构造按字典次序的最优二元树的一种算法。
The paper discusses a nonregular cost function and its optimum criterion, presenting an algorithm of constructing and optimal alphabetic binary tree under this criterion.
利用二元决策图(BDD)中的B—割集和节点概率，提出了基于BDD的关联故障树定量分析新算法。
By the B-cut sets and the probabilities of the nodes of Binary Decision Diagrams (BDD), a new quantitative analysis algorithm of coherent fault tree based on BDD is presented in this paper.
利用二元决策图(BDD)中的B—割集和节点概率，提出了基于BDD的关联故障树定量分析新算法。
By the B-cut sets and the probabilities of the nodes of Binary Decision Diagrams (BDD), a new quantitative analysis algorithm of coherent fault tree based on BDD is presented in this paper.
应用推荐