Title :
Comments on "Artificial neural networks for four-coloring map problems and K-colorability problems"
Author :
Tateishi, M. ; Tamura, Shinji
Author_Institution :
Res. Labs., Nippondenso Co. Ltd., Aichi, Japan
fDate :
3/1/1994 12:00:00 AM
Abstract :
The paper (see ibid., vol 38 p 326-33, 1991) gives a proof that the binary Hopfield neural network using the McCulloch-Pitts binary neuron model converges to the local minimum. In this correspondence the authors present a counter example to the proof and then point out the error in the proof.<>
Keywords :
Hopfield neural nets; graph colouring; learning (artificial intelligence); K-colorability problems; McCulloch-Pitts binary neuron model; artificial neural networks; binary Hopfield neural network; four-coloring map problems; local minimum; Artificial neural networks; Computer networks; Convergence; Counting circuits; Hopfield neural networks; Neural networks; Neurons; Polynomials;
Journal_Title :
Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on
