Translation of Decision Tables
ACM Computing Surveys (CSUR)
The synthetic approach to decision table conversion
Communications of the ACM
Combining decision rules in a decision table
Communications of the ACM
On the conversion of programs to decision tables: method and objectives
Communications of the ACM
Use of decision tables in computer programming
Communications of the ACM
Conversion of decision tables to computer programs
Communications of the ACM
Conversion of limited-entry decision tables to computer programs
Communications of the ACM
Mining optimal decision trees from itemset lattices
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
An Effective Data Classification Algorithm Based on the Decision Table Grid
ICIS '08 Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008)
A dynamic decision network framework for online media adaptation in stroke rehabilitation
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Cause effect graph to decision table generation
ACM SIGSOFT Software Engineering Notes
RNA Search with Decision Trees and Partial Covariance Models
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Information theory-based code optimization of matrix elements for overall rotation angular momenta
BIOCOMPUCHEM'09 Proceedings of the 3rd WSEAS International Conference on Computational Chemistry
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part I
| Hi-index | 0.00 |
In this work, we determine all possible angular momentum matrix elements arising in the variational treatment of the rovibrational molecular Hamiltonian. In addition, the logic of the associated computing process is organized in a series of decision tables. Using Shwayder's approach, information theory is applied to obtain optimal computing codes from the decision tables. The needed decision rules apparition frequencies are computed as a function of the rotational quantum number J. Using these values, we show that the codes obtained are optimal for any value of J. In all cases, the optimal codes exhibit an efficiency of at least a 97% of the theoretical maximum. In addition, pessimal codes are obtained as a counterpart of the optimal ones. We find that the efficiency difference between the optimal and pessimal codes reaches quickly a limit for increasing values of the J quantum number.