首页> 外文OA文献 >Binary decision diagram with minimum expected path length
【2h】

Binary decision diagram with minimum expected path length

机译:具有最小预期路径长度的二进制决策图

摘要

[[abstract]]We present methods to generate a Binary Decision Diagram (BDD) with minimum expected path length. A BDD is a generic data structure which is widely used in several fields. One important application is the representation of Boolean functions. A BDD representation enables us to evaluate a Boolean function: Simply traverse the BDD from the root node to the terminal node and retrieve the value in the terminal node. For a BDD with minimum expected path length will be also minimized the evaluation time for the corresponding Boolean function. Three efficient algorithms for constructing BDDs with minimum expected path length are proposed
机译:[[摘要]]我们介绍了生成具有最小预期路径长度的二元决策图(BDD)的方法。 BDD是一种通用数据结构,已在多个领域中广泛使用。一个重要的应用是布尔函数的表示。 BDD表示使我们能够评估布尔函数:只需将BDD从根节点遍历到终端节点,然后在终端节点中检索值。对于具有最小预期路径长度的BDD,还将最小化相应布尔函数的评估时间。提出了三种构建期望路径长度最小的BDD的有效算法

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号