Bounds on the Convergence Probabilities of Learning Automata
Authors:
- S LakshmivarahanSLS Lakshmivarahan
- M L ThathacharMTM L Thathachar
- 1 November 1976
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics
- Vol. SMC-6 (11) , 756-763
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Learning Automata - A SurveyIEEE Transactions on Systems, Man, and Cybernetics, 1974
- Two ?-Optimal Nonlinear Reinforcement Schemes for Stochastic AutomataIEEE Transactions on Systems, Man, and Cybernetics, 1974
- Absolutely Expedient Learning Algorithms for Stochastic AutomataIEEE Transactions on Systems, Man, and Cybernetics, 1973
- On the linear model with two absorbing barriersJournal of Mathematical Psychology, 1968
- On Expediency and Convergence in Variable-Structure AutomataIEEE Transactions on Systems Science and Cybernetics, 1968
- Some convergence theorems for stochastic learning models with distance diminishing operatorsJournal of Mathematical Psychology, 1968
- A stochastic automaton model for the synthesis of learning systemsIEEE Transactions on Systems Science and Cybernetics, 1966