Critical analysis of hopfield's neural network model and heuristic algorithm for shortest path computation for routing in computer networks

Author(s):  
Farah Sarwar ◽  
Abdul Aziz Bhatti
2001 ◽  
Vol 12 (5) ◽  
pp. 1067-1073 ◽  
Author(s):  
F. Araujo ◽  
B. Ribeiro ◽  
L. Rodrigues

2018 ◽  
Vol 50 (2) ◽  
pp. 1527-1548 ◽  
Author(s):  
Mohammad Eshaghnezhad ◽  
Freydoon Rahbarnia ◽  
Sohrab Effati ◽  
Amin Mansoori

2014 ◽  
Vol 69 (3-4) ◽  
pp. 129-134 ◽  
Author(s):  
Farah Sarwar ◽  
Shaukat Iqbal

This presentation provides a mathematical survey of parameters used to adjust weights in Hopfield neural network (HNN). These parameter values are used to adjust the rate of convergence, optimality ratio, and precision of the network for a given problem. Optimal shortest routing path computation is discussed here as one of the optimization problems. A detailed analysis of one such energy function is carried out by varying the parameter values one by one in different ranges. A comprehensive conclusion is presented here about the proper criterion for selecting the values of these effectual parameters.


Sign in / Sign up

Export Citation Format

Share Document