Relaxation Labeling with Learning Automata

DOI10.1109/TPAMI.1986.4767779MaRDI QIDQ3747730zbMATH OpenOpenAlexWikidataFDO

Authors M. A. L. Thathachar, P. S. Sastry

Publication date 1986

Published in IEEE Transactions on Pattern Analysis and Machine Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tpami.1986.4767779

zbMATH Keywords

consistencyconstraint satisfactionprobabilistic relaxationstochastic algorithmsweak convergence

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• The dynamics of nonlinear relaxation labeling processes.
• A continuous relaxation labeling algorithm for Markov random fields
• Relaxation labeling: 25 years and still iterating
• Probabilistic relaxation labelling using the Fokker-Planck equation
• Some properties of stochastic labeling procedures

Cited in

(13)

• A hierarchical system of learning automata that can learn the globally optimal path
• On the foundations of probabilistic relaxation with product support
• Absolutely expedient algorithms for learning Nash equilibria
• Relaxation labeling: 25 years and still iterating
• Relaxation labeling using an improved Hopfield neural network
• A continuous relaxation labeling algorithm for Markov random fields
• Relaxation labeling based task scheduling in heterogeneous environments
• scientific article; zbMATH DE number 1928652 (Why is no real title available?)
• An introduction to learning automata and optimization
• Stochastic networks for constraint satisfaction and optimization.
• Stochastic automata and learning systems.
• Pioneering approaches for enhancing the speed of hierarchical LA by \textit{ordering} the actions
• Probabilistic relaxation labelling using the Fokker-Planck equation

This page was built for publication: Relaxation Labeling with Learning Automata

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