Absolute expediency of learning automata
- 31 March 1979
- journal article
- Published by Elsevier in Information Sciences
- Vol. 17 (2) , 91-112
- https://doi.org/10.1016/0020-0255(79)90034-3
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Bounds on the Convergence Probabilities of Learning AutomataIEEE Transactions on Systems, Man, and Cybernetics, 1976
- The Structures of Automata to Adapt to an Unknown EnvironmentIEEE Transactions on Systems, Man, and Cybernetics, 1976
- Absolute Expediency of Q-and S-Model Learning AlgorithmsIEEE Transactions on Systems, Man, and Cybernetics, 1976
- Learning Automata - A SurveyIEEE Transactions on Systems, Man, and Cybernetics, 1974
- Absolutely Expedient Learning Algorithms for Stochastic AutomataIEEE Transactions on Systems, Man, and Cybernetics, 1973
- Stochastic Automata Models with Applications to Learning SystemsIEEE Transactions on Systems, Man, and Cybernetics, 1973
- Optimal non-linear reinforcement schemes for stochastic automataInformation Sciences, 1972
- A Note on the Linear Reinforcement Scheme for Variable-Structure Stochastic AutomataIEEE Transactions on Systems, Man, and Cybernetics, 1972