A discrete-time recurrent neural network for shortest-path routing

2000 ◽  
Vol 45 (11) ◽  
pp. 2129-2134 ◽  
Author(s):  
Jun Wang ◽  
Youshen Xia
Keyword(s):  
Neural Network ◽  
Discrete Time ◽  
Shortest Path ◽  
Recurrent Neural Network ◽  
Shortest Path Routing

Convergence Theory for Unified Discrete-Time RNNs with Quasi-Symmetric Connection

2014 ◽  
Vol 538 ◽  
pp. 167-170
Author(s):  
Hui Zhong Mao ◽  
Chen Qiao ◽  
Wen Feng Jing ◽  
Xi Chen ◽  
Jin Qin Mao
Keyword(s):  
Neural Network ◽  
Global Convergence ◽  
Discrete Time ◽  
Recurrent Neural Network ◽  
Symmetric Matrix ◽  
Network Models ◽  
Convergence Theory ◽  
Connection Matrix ◽  
Neural Network Models ◽  
Symmetric Connection

This paper presents the global convergence theory of the discrete-time uniform pseudo projection anti-monotone network with the quasi–symmetric matrix, which removes the connection matrix constraints. The theory widens the range of applications of the discrete–time uniform pseudo projection anti–monotone network and is valid for many kinds of discrete recurrent neural network models.

Sign in / Sign up

Export Citation Format

Share Document