Cooperative updating in the Hopfield model

IEEE Transactions on Neural Networks

Volumn 12, Issue 5, 2001, Pages 1243-1251

  Munehisa, T ^a   Kobayashi, M ^a   Yamazaki, H ^a  

^a UNIVERSITY OF YAMANASHI   (Japan)

Author keywords

Combinatorial optimization problems; Constraint satisfaction problems; Detailed balance equation; Hopfield model; Updating

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; GRAPH THEORY; MATHEMATICAL MODELS; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; TRAVELING SALESMAN PROBLEM;

BOLTZMANN DISTRIBUTION; CONSTRAINT SATISFACTION PROBLEM; FOUR COLOR PROBLEM; GRAPH BIPARTITIONING PROBLEM; HOPFIELD MODEL;

NEURAL NETWORKS;

EID: 0035441195     PISSN: 10459227     EISSN: None     Source Type: Journal    
DOI: 10.1109/72.950153     Document Type: Article

References (32)

1. Neural computation of decisions in optimization problems
2. Constraint satisfaction problems
3. Simulated Annealing and Boltzmann Machines
4. Neural techniques for combinatorial optimization with application
5. A parallel algorithm for tiling problems
6. Algorithm development for neural networks
7. Design of neurocomputer architectures for large-scale constraint satisfaction problems
8. SDNN: An O(1) parallel processing with strictly digital neural networks for combinatorial optimization
9. Learning in stochastic neural networks for constraint satisfaction problems
10. Fixed point behavior of threshold functions on a finite set
11. New Monte Carlo methods for improved efficiency of computer simulations in statistical mechanics
12. Introduction to Monte Carlo algorithms
13. Toward practical neural computation for combinatorial optimization problems
14. Segment reversal and the TSP
15. Edge assembly crossover: A high-power genetic algorithm for the travelling salesman problem
16. The proposal and evaluation of a crossover for travelling salesman problems
17. An efficient heuristic algorithm for the travelling salesman problem
18. Solving large scale puzzles with neural networks
19. Vergleich verschiedener Neuronenmodelle zur Lösung kombinatorischer Suchproblemes
20. Fast search algorithms for the N-queens problem
21. A polynomial time algorithm for the n-queens problems
22. 3 000 000 queens in less than one minute
23. Minimizing conflicts: A heuristic repair method for constraint satisfaction problems
24. A note on the queens' problem
25. An efficient heuristic procedure for partitioning graph
26. Application of statistical mechanics to NP-complete problems in combinatorial optimization
27. Combination of chaotic neurodynamics with the 2-opt algorithm to solve traveling salesman problems
28. On chaotic simulated annealing