| 1. | Speedup generation method for test pattern based on bdd learning
用二叉决策图学习加速测试模式生成 |
| 2. | Finally , we study two applications of bdd . the first one is the fault detect of combinational logic circuits
最后，研究了基于bdd的组合电路的故障检测方法和基于bdd的网络可靠度的计算方法等两方面的应用。 |
| 3. | The probability and unconditional failure intensity of top event was computed in the quantitative analysis of fta based on bdd
在基于bdd的故障树定量分析研究中，实现了顶事件发生概率和绝对失效强度的求解。 |
| 4. | A simple and easy using variable ordering algorithm is presented , which does n ' t involve in the knowledge of other fields
在此基础上，提出了在bdd的建模中一种简单、易行的编序算法，该算法不涉及其他领域的概念，容易理解。 |
| 5. | The bdd electrode exhibited well - resolved and irreversible reduction voltammograms , while the gc electrode provided only ill - defined response
Br -和i -在bdd电极上发生了典型不可逆的电化学还原反应,与其在玻碳电极上响应不同。 |
| 6. | First , this paper introduces the principle and correlative conclusions of hdd , and illuminates the important of variable ordering to a bdd
本文首先介绍了bdd的原理与相关结论，说明了变量编序对于bdd规模(节点数和路径深度)大小的影响。 |
| 7. | According to the relationship of shannon ' s formula of boolean functions and bdd , the fault tree structure to bdd conversion was accomplished by recursive method
依据布尔函数shannon分解和bdd图的关系，用递归法实现了故障树向bdd转化。 |
| 8. | A fault tree module analysis ( ftma ) based on . depth - first left - most traversals and bdd was presented to solve large complicated fta problems
为解决大型复杂故障树的简化分析问题，提出并实现了基于深度优先最左遍历和bdd相结合的故障树模块分析法。 |
| 9. | An active fta constructing method , qualitative and quantitative as well as module analysis of fta based on binary decision diagram ( bdd ) was researched in this thesis
本文研究了动态建造故障树的方法，以及基于bdd的故障树定性分析、定量分析和模块分析方法。 |
| 10. | Second , this paper also discusses the construction of bdd . according to the popular ite ( if - then - else ) algorithm , we construct the bdd by c + + program
其次，对bdd包的建立进行了讨论，并以现在较为流行的ite ( ifthen - else )算法为依据，用c + +语言进行了bdd的构建。 |
