Publication:
Exact and heuristic minimization of the average path length in decision diagrams

Loading...
Thumbnail Image
Authors
Mishchenko, Alan
Sasao, Tsutomu
Butler, Jon T.
Nagayama, Shinobu
Subjects
BDD
MDD
average path length (APL)
node traversing probability
edge traversing probability
branch-and-bound
sifting algorithm
Advisors
Date of Issue
2005-08
Date
August 2005
Publisher
Language
Abstract
In a decision diagram, the average path length (APL) is the average number of nodes on a path from the root node to a terminal node over all assignments of values to variables...
Type
Article
Description
Journal of Multiple-Valued Logic and Soft Computing, Vol.11, No.5-6, pp.437-465, Aug. 2005.
Two versions of this work are available.
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. As such, it is in the public domain, and under the provisions of Title 17, United States Code, Section 105, may not be copyrighted.
Series/Report No
Department
Department of Electrical and Computer Engineering
Other Units
Identifiers
NPS Report Number
Sponsors
Funder
Format
Citation
S. Nagayama, A. Mishchenko, T. Sasao, and Jon T. Butler, “Exact and heuristic minimization of the average path length in decision diagrams" Journal of Multiple-Valued Logic and Soft Computing, Vol.11, No.5-6, pp.437-465, Aug. 2005. (Two versions are available)
Distribution Statement
Rights
Collections