Abstract
A discrete-time quantized-state Hopfield neural network is analyzed with special emphasis in its convergence, complexity and scalability properties. This network can be considered as a generalization of the Hopfield neural network by Shrivastava et al. [27] into the interior of the unit hypercube. This extension allows its use in a larger set of combinatorial optimization problems and its properties make of it a good candidate to build hybrid algorithms along with other heuristics such as the evolutive algorithms. Finally, the network is illustrated in some instances of the linear assignment problem and the frequency assignment problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have