Signature Table Systems and Learning
- 1 January 1982
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics
- Vol. 12 (5) , 635-648
- https://doi.org/10.1109/tsmc.1982.4308882
Abstract
A characterization theorem is given for the classes of functions which are representable by signature table systems. The usefulness of the theorem is demonstrated in the analysis and synthesis of such systems. The limitations on the power of these systems come from the restrictions on the table alphabet sizes, and a technique is given for evaluating these limitations. A practical learning system is proposed and analyzed in terms of the theoretical model of this paper. Then an improved method is described and results are presented from a series of experiments.Keywords
This publication has 7 references indexed in Scilit:
- Estimation of Run Times using Signature Table Analysis.Published by Defense Technical Information Center (DTIC) ,1978
- Heuristics for Signature Table Analysis as a Pattern Recognition TechniqueIEEE Transactions on Systems, Man, and Cybernetics, 1977
- A comparison and evaluation of three machine learning procedures as applied to the game of checkersArtificial Intelligence, 1974
- A learning program which plays partnership dominoesCommunications of the ACM, 1973
- Some Studies in Machine Learning Using the Game of Checkers. II—Recent ProgressIBM Journal of Research and Development, 1967
- Functional Decomposition and Switching Circuit DesignJournal of the Society for Industrial and Applied Mathematics, 1963
- Some Studies in Machine Learning Using the Game of CheckersIBM Journal of Research and Development, 1959