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.

This publication has 4 references indexed in Scilit: