ACM Home Page
Please provide us with feedback. Feedback
Conversion of Limited-Entry Decision Tables to Optimal Computer Programs II: minimum storage requirement
Full text PdfPdf (932 KB)
Source Journal of the ACM (JACM) archive
Volume 14 ,  Issue 4  (October 1967) table of contents
Pages: 742 - 756  
Year of Publication: 1967
ISSN:0004-5411
Authors
Lewis T. Reinwald  Research Analysis Corporation, McLean, Virginia
Richard M. Soland  Research Analysis Corporation, McLean, Virginia
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 17,   Citation Count: 13
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/321420.321433
What is a DOI?

ABSTRACT

Given the number of words of computer storage required by the individual tests in a limited-entry decision table, it is sometimes desirable to find an equivalent computer program with minimum total storage requirement. In this paper an algorithm is developed to do this. The rules in the decision table are grouped into action sets, so that several rules with the same actions need not be distinguished. Moreover, if certain combinations of conditions can be excluded from consideration, the algorithm will take advantage of this extra information. The algorithm is initially developed for computer programs possessing a treelike form and then extended to a wider class of programs. The algorithm can be combined with one which finds an equivalent computer program with minimum average processing time, and thus used to find an equivalent computer program which minimizes a cost function which is nondecreasing in both average processing time and total storage requirement.



CITED BY  13

Collaborative Colleagues:
Lewis T. Reinwald: colleagues
Richard M. Soland: colleagues