Access Restriction

Author Shwayder, Keith
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Decision tables ♦ Coding ♦ Flowcharting ♦ Noiseless channel ♦ Information theory ♦ Sorting
Abstract This paper modifies an earlier algorithm for converting decision tables into flowcharts which minimize subsequent execution time when compiled into a computer program.The algorithms considered in this paper perform limited search and, accordingly, do not necessarily result in globally optimal solutions. However, the greater search effort needed to obtain a globally optimal solution for complex decision tables is usually not justified by sufficient savings in execution time.There is an analogy between the problem of converting decision tables into efficient flowcharts and the well-understood problem in information theory of noiseless coding. The results of the noiseless coding literature are used to explore the limitations of algorithms used to solve the decision table problem.The analogy between the two problems is also used to develop improvements to the information algorithm in extending the depth of search under certain conditions and in proposing additional conditions to be added to the decision table.Finally, the information algorithm is compared with an algorithm proposed in a recent paper by Verhelst.
Description Affiliation: Univ. of Chicago, Chicago, IL, and Samsonite Corp., Denver, CO (Shwayder, Keith)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 17
Issue Number 9
Page Count 6
Starting Page 532
Ending Page 537

Open content in new tab

   Open content in new tab
Source: ACM Digital Library