节点文献
计算不交和的一个新算法
A New Algorithm for Calculating the Sum of Disjoint Products
【摘要】 提出一个计算网络可靠度的有效算法。算法基于二分决策图,但采用新的法则选取shannon公式中的关键字母及因式分解技巧,与已有的某些算法相比,算例表明这个算法比较简单,产生比较少的不交和项及比较紧凑的公式。
【Abstract】 An efficient algorithm for calculating the reliability of a network by the sum of disjoint products(SDP) is presented. The algorithm uses the binary decision diagram, but adopts a new rule to select the key letter in Shannon’s formula as well as factorization technique. Compared with some known algorithms, an example shows that this algorithm is simpler, generates fewer SDP terms and a compacter reliability formula.
【基金】 国家自然科学基金(19871007)
- 【文献出处】 科学技术与工程 ,Science Technology and Engineer , 编辑部邮箱 ,2003年06期
- 【分类号】O157.5
- 【被引频次】2
- 【下载频次】79