DocumentCode :
1132188
Title :
Worst-case convergence times for Hopfield memories
Author :
Floréen, Patrik
Author_Institution :
Dept. of Comput. Sci., Helsinki Univ., Finland
Volume :
2
Issue :
5
fYear :
1991
fDate :
9/1/1991 12:00:00 AM
Firstpage :
533
Lastpage :
535
Abstract :
The worst-case upper bound on the convergence time of Hopfield associative memories is improved to half of its previously known value. Also, the consequences of allowing `don´t know´ bits in both the input and the output are considered
Keywords :
content-addressable storage; convergence; neural nets; Hopfield memories; associative memories; convergence time; neural nets; worst-case upper bound; Associative memory; Computer networks; Computer science; Convergence; Hopfield neural networks; Lyapunov method; Neural networks; Symmetric matrices; Tensile stress; Upper bound;
fLanguage :
English
Journal_Title :
Neural Networks, IEEE Transactions on
Publisher :
ieee
ISSN :
1045-9227
Type :
jour
DOI :
10.1109/72.134291
Filename :
134291
Link To Document :
بازگشت