DocumentCode
1043815
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
Volume
41
Issue
3
fYear
1994
fDate
3/1/1994 12:00:00 AM
Firstpage
248
Lastpage
249
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;
fLanguage
English
Journal_Title
Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on
Publisher
ieee
ISSN
1057-7122
Type
jour
DOI
10.1109/81.273927
Filename
273927
Link To Document