On problem solving with Hopfield neural networks |
| |
Authors: | Behzad Kamgar-Parsi Behrooz Kamgar-Parsi |
| |
Institution: | (1) Center for Automation Research, University of Maryland, 20742 College Park, MD, USA;(2) Center for Applied Research in Artificial Intelligence, Naval Research Laboratory, 20375 Washington, DC, USA |
| |
Abstract: | Hopfield and Tank have shown that neural networks can be used to solve certain computationally hard problems, in particular they studied the Traveling Salesman Problem (TSP). Based on network simulation results they conclude that analog VLSI neural nets can be promising in solving these problems. Recently, Wilson and Pawley presented the results of their simulations which contradict the original results and cast doubts on the usefulness of neural nets. In this paper we give the results of our simulations that clarify some of the discrepancies. We also investigate the scaling of TSP solutions found by neural nets as the size of the problem increases. Further, we consider the neural net solution of the Clustering Problem, also a computationally hard problem, and discuss the types of problems that appear to be well suited for a neural net approach. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|