Direct search for global minimum in neural network
作者:
Katsuo Toguchi,
Toshihiro Shimizu,
期刊:
AIP Conference Proceedings
(AIP Available online 1900)
卷期:
Volume 519,
issue 1
页码: 655-657
ISSN:0094-243X
年代: 1900
DOI:10.1063/1.1291638
出版商: AIP
数据来源: AIP
摘要:
A new model of neural network is proposed and applied to the traveling salesman problem with 10 cities. It is shown that the network can find the shortest path in the ratio of 100&percent; without being trapped in any local minima. The mechanism is investigated. ©2000 American Institute of Physics.
点击下载:
PDF
(194KB)
返 回