Stochastic networks for constraint satisfaction and optimization.

DOI10.1007/BF02811324zbMath1075.68637OpenAlexW2167946853MaRDI QIDQ5955742

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

• Optimization by Simulated Annealing
• ``Neural computation of decisions in optimization problems
• On the Foundations of Relaxation Labeling Processes
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• Convergence and finite-time behavior of simulated annealing
• Relaxation Labeling with Learning Automata
• Probabilistic Solution of Ill-Posed Problems in Computational Vision
• Comparison of the efficiency of deterministic and stochastic algorithms for visual reconstruction
• Unnamed Item
• Unnamed Item
• Unnamed Item

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