Improved exploration in Hopfield network state-space through parameter perturbation driven by simulated annealing
From MaRDI portal
Publication:1296032
Recommendations
- scientific article; zbMATH DE number 5280209
- Managing spatio-temporal complexity in Hopfield neural network simulations for large-scale static optimization.
- scientific article; zbMATH DE number 41891
- Efficiency comparison of Hopfield network with simulated annealing as optimization methods for solving the traveling salesman problem
- On parameter settings of Hopfield networks applied to traveling salesman problems
- Hopfield neural networks for optimization: Study of the different dynamics
- An improved learning algorithm for discrete Hopfield
Cites work
- scientific article; zbMATH DE number 41891 (Why is no real title available?)
- scientific article; zbMATH DE number 53884 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- Equation of state calculations by fast computing machines
- Neural networks and physical systems with emergent collective computational abilities
- On the approximation of NP-complete problems by using the Boltzmann machine method: the cases of some covering and packing problems
- Optimization by simulated annealing
- ``Neural computation of decisions in optimization problems
This page was built for publication: Improved exploration in Hopfield network state-space through parameter perturbation driven by simulated annealing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296032)