Thumbnail
Access Restriction
Subscribed

Author Reinwald, Lewis T. ♦ Soland, Richard M.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1966
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract This paper begins with a brief description of desicion tables, and then presents a discussion of alternative expressions for them as sequential testing procedures for computer implementation and as Boolean functions. An algorithm is developed which, in a finite number of steps, will convert any given limited entry decision table into an “optimal” computer program, one with minimum average processing time. The algorithm is more general than procedures previously developed and guarantees optimality of the resultant computer program. Previous procedures required two distinct steps and gave no assurance of overall optimality. Computer implementation of the algorithm is also discussed.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1966-07-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 13
Issue Number 3
Page Count 20
Starting Page 339
Ending Page 358


Open content in new tab

   Open content in new tab
Source: ACM Digital Library