Absolute expediency of learning automata

DOI10.1016/0020-0255(79)90034-3zbMath0442.68050OpenAlexW2012286375MaRDI QIDQ1143800

Hirotomo Aso, Masayuki Kimura

Publication date: 1979

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(79)90034-3

zbMATH Keywords

stationary random environmentabsolutely expedient automata

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (4)

On a general class of absorbing-barrier learning algorithms ⋮ epsilon-optimality of a general class of learning algorithms ⋮ An Introduction to Learning Automata and Optimization ⋮ Absolutely expedient algorithms for learning Nash equilibria

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the behavior of finite automata in random media
• Optimal non-linear reinforcement schemes for stochastic automata
• The Structures of Automata to Adapt to an Unknown Environment
• Absolute Expediency of Q-and S-Model Learning Algorithms
• Bounds on the Convergence Probabilities of Learning Automata
• Learning Automata - A Survey
• A Note on the Linear Reinforcement Scheme for Variable-Structure Stochastic Automata
• Stochastic Automata Models with Applications to Learning Systems
• Absolutely Expedient Learning Algorithms for Stochastic Automata

This page was built for publication: Absolute expediency of learning automata