Thumbnail
Access Restriction
Subscribed

Author Shwayder, Keith
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Coding ♦ Entropy ♦ Noiseless channel ♦ Decision table ♦ Information theory ♦ Sorting
Abstract Pollack has proposed an algorithm for converting decision tables into flowcharts which minimize subsequent execution time when compiled into a computer program. Two modifications o this algorithm are proposed. The first relies on Shannon's noiseless coding theorem and the communications concept of entropy but does not completely test the ELSE Rule. The second modification completely tests the ELSE Rule but results in more executions than the first modification. Both modifications result in lower execution time than Pollack's algorithm. However, neither modification guarantees a globally optimal solution.
Description Affiliation: Univ. of Chicago, IL (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 14
Issue Number 2
Page Count 5
Starting Page 69
Ending Page 73


Open content in new tab

   Open content in new tab
Source: ACM Digital Library