Stochastic networks for constraint satisfaction and optimization.

DOI10.1007/BF02811324MaRDI QIDQ5955742zbMATH OpenOpenAlexFDO

Authors P. S. Sastry

Publication date 18 February 2002

Published in Sādhanā (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02811324

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites work

• ``Neural computation of decisions in optimization problems
• Comparison of the efficiency of deterministic and stochastic algorithms for visual reconstruction
• Convergence and finite-time behavior of simulated annealing
• scientific article; zbMATH DE number 3878095 (Why is no real title available?)
• scientific article; zbMATH DE number 4088961 (Why is no real title available?)
• scientific article; zbMATH DE number 3274494 (Why is no real title available?)
• On the Foundations of Relaxation Labeling Processes
• Optimization by simulated annealing
• Probabilistic Solution of Ill-Posed Problems in Computational Vision
• Relaxation Labeling with Learning Automata
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images

This page was built for publication: Stochastic networks for constraint satisfaction and optimization.

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