DocumentCode :
2487982
Title :
Shortest paths computation of graph by neural networks in real time
Author :
Daming, Zhu ; Shaohan, Ma
Author_Institution :
Dept. of Comput. Sci., Shandong Univ., Jinan, China
Volume :
2
fYear :
1996
fDate :
14-18 Oct 1996
Firstpage :
1461
Abstract :
A new kind of neural networks on solving shortest paths problem is presented, and the stability of the neural networks is proved. For a directed or undirected graph, the proposed neural network is always convergent to its single equilibrium, so that the shortest paths between every pair of nodes of the oriented graph are produced. This paper makes a new study on solving the optimization but not NP-hard problems by neural networks
Keywords :
directed graphs; neural nets; numerical stability; optimisation; convergence; directed graph; equilibrium; neural network stability; nodes; optimization problem solution; oriented graph; real time computation; shortest paths computation; shortest paths problem solution; undirected graph; Computer networks; H infinity control; Intelligent networks; Neural networks; Neurons; Statistics;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Signal Processing, 1996., 3rd International Conference on
Conference_Location :
Beijing
Print_ISBN :
0-7803-2912-0
Type :
conf
DOI :
10.1109/ICSIGP.1996.571138
Filename :
571138
Link To Document :
بازگشت