Exact and heuristic minimization of the average path length in decision diagrams
Butler, Jon T.
MetadataShow full item record
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...
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.
Showing items related by title, author, creator and subject.
Rowe, Neil C. (Monterey, California. Naval Postgraduate School, 2005-05);We develop methods for assessing the typicality of the file system of a computer. This is helpful in analyzing, for instance, captured terrorist machines to decide if their information is genuine and for testing whether a ...
Average path length as a paradigm for the fast evaluation of functions represented by binary decision diagrams Sasao, T.; Matsuura, M.; Butler, Jon T. (2002-11);This paper focuses on the average path length (APL) of BDD's for switching functions. APL is a metric for the time it takes to evaluate the function by a computer program. We derive the APL for the AND, OR, parity, ...
Lathroum, John A. (Monterey, California. Naval Postgraduate School, 1998-03-01);This thesis analyzes the top ten Master's of Business Administration (MBA) programs and top ten Public Management programs in the United States and has established a definition of quality in graduate management education ...