Absolute expediency of learning automata-Reference-Cited by-同舟云学术

Absolute expediency of learning automata

Published:1979-03 Issue:2 Volume:17 Page:91-112
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Aso Hirotomo,Kimura Masayuki

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference14 articles.

1. Optimal non-linear reinforcement schemes for stochastic automata;Lakshmivarahan;Information Sci.,1972

2. Absolutely expedient learning algorithms for stochastic automata;Lakshmivarahan;IEEE Trans. Systems Man, and Cybernet.,1973

3. Absolute expediency of Q- and S-model learning algorithms;Lakshmivarahan;IEEE Trans. Systems, Man, and Cybernet.,1976

4. S. Lakshmivarahan and M. A. L. Thathachar, Bounds on the convergence probabilities of learning automata, IEEE Trans. Systems, Man, and Cybernet. SMC-6:756–763.

5. Algorithms for changing stochastic automata transition probabilities;Vorontsova;Problemy Peredači Informacii,1965

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An Introduction to Learning Automata and Optimization;Intelligent Systems Reference Library;2021

2. Varieties of Cellular Learning Automata: An Overview;Cellular Learning Automata: Theory and Applications;2020-07-25

3. Introduction to Learning Automata Models;Studies in Computational Intelligence;2019

4. Absolutely expedient algorithms for learning Nash equilibria;Proceedings Mathematical Sciences;1994-02

5. A Conceptual Model of Adaptive Knowledge-Based Systems;Information Systems Research;1992-06