W. H. Dailey
Abstract
This paper describes a technique for generating binary decision trees from decision tables. It starts with a fully expended table and does a partial reduction with respect to the actions. The remainder of the reduction is done without reference to actions. Pollack's algorithm is finally applied to determine the next decision to consider.
- W. H. Dailey, Some notes on processing limited entry decision tables, Sigplan notices 6, No. 8, 81--89 (Sep. 1971) Google Scholar
Digital Library
- S. L. Pollack, Conversion of limited entry decision tables to computer programs, Comm. ACM 8, No. 11, 677--682 (Nov. 1965) Google ScholarDigital Library
- V. G. Sprague, On storage space of decision table, Comm. ACM 9, No. 5, 319 (May 1966) Google ScholarDigital Library
- Toshio Yasui, Some aspects of decision table conversion techniques, Sigplan notices 6, No. 8, 108--111 (Sep. 1971) Google ScholarDigital Library
Recommendations
On Random Binary Trees
A widely used class of binary trees is studied in order to provide information useful in evaluating algorithms based on this storage structure. A closed form counting formula for the number of binary trees with n nodes and height k is developed and ...
An optimal insertion algorithm for one-sided height-balanced binary search trees
An algorithm for inserting an element into a one-sided height-balanced (OSHB) binary search tree is presented. The algorithm operates in time O(log n), where n is the number of nodes in the tree. This represents an improvement over the best previously ...
A New Algorithm for Minimum Cost Binary Trees
A new algorithm for constructing minimum cost binary trees in $O(n \log n)$ time is presented. The algorithm is similar to the well-known Hu-Tucker algorithm. Our proof of validity is based on finite variational methods and is therefore quite different ...
Comments