Bounds on the Convergence Probabilities of Learning Automata

DOI10.1109/TSMC.1976.4309449MaRDI QIDQ4121843zbMATH OpenOpenAlexFDO

Authors S. Lakshmivarahan, M. A. L. Thathachar

Publication date 1976

Published in IEEE Transactions on Systems, Man, and Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tsmc.1976.4309449

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(10)

• The use of learning algorithms in telephone traffic routing - a methodology
• Absolute expediency of learning automata
• epsilon-optimality of a general class of learning algorithms
• A new approach to the vertex coloring problem
• Asymptotic behaviour of a learning algorithm
• Finding Maximum Clique in Stochastic Graphs Using Distributed Learning Automata
• Convergence in models with bounded expected relative hazard rates
• Clustering the wireless ad hoc networks: a distributed learning automata approach
• Finding minimum weight connected dominating set in stochastic graph based on learning automata
• A cooperative game of a pair of learning automata

This page was built for publication: Bounds on the Convergence Probabilities of Learning Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4121843)