Mean field annealing
From HandWiki - Reading time: 1 min
 | This article relies largely or entirely on a single source. (June 2017) |
 | This article may be too technical for most readers to understand. Please help improve it to make it understandable to non-experts, without removing the technical details. (June 2017) (Learn how and when to remove this template message) |
Mean field annealing is a deterministic approximation to the simulated annealing technique of solving optimization problems.[1] This method uses mean field theory and is based on Peierls' inequality.
References
- ↑ Bilbro, G.L.; Snyder, W.E.; Garnier, S.J.; Gault, J.W. (Jan 1992). "Mean field annealing: a formalism for constructing GNC-like algorithms". IEEE Transactions on Neural Networks 3 (1): 131–138. doi:10.1109/72.105426. PMID 18276414. http://www.ece.ncsu.edu/imaging/Publications/1992/BilbroSnyderTNN.pdf.
 |  |
Licensed under CC BY-SA 3.0 | Source: https://handwiki.org/wiki/Mean_field_annealing5 views | ↧ Download this article as ZWI file
EncycloReader
is supported by the 
KSF