Asymmetric continuous-time neural networks without local traps for solving constraint satisfaction problems.
There has been a long history of using neural networks for combinatorial optimization and constraint satisfaction problems. Symmetric Hopfield networks and similar approaches use steepest descent dynamics, and they always converge to the closest local minimum of the energy landscape. For finding glo...
Main Authors: | Botond Molnár, Mária Ercsey-Ravasz |
---|---|
Format: | Article |
Language: | English |
Published: |
Public Library of Science (PLoS)
2013-01-01
|
Series: | PLoS ONE |
Online Access: | http://europepmc.org/articles/PMC3774769?pdf=render |
Similar Items
-
A continuous-time MaxSAT solver with high analog performance
by: Botond Molnár, et al.
Published: (2018-11-01) -
Community detection in directed weighted networks using Voronoi partitioning
by: Botond Molnár, et al.
Published: (2024-04-01) -
Solving the Weighted Constraint Satisfaction Problems Via the Neural Network Approach
by: Khalid Haddouch, et al.
Published: (2016-09-01) -
Using Stochastic Spiking Neural Networks on SpiNNaker to Solve Constraint Satisfaction Problems
by: Gabriel A. Fonseca Guerra, et al.
Published: (2017-12-01) -
Learning variable ordering heuristics for solving constraint satisfaction problems
by: Song, Wen, et al.
Published: (2022)