In this paper a new neural network model that generalizes Hopfield model is proposed. It allows to implement an algorithm similar to the Dijkstra's one in order to solve the shortest path problem on a weighted graph. With this neural and parallel implementation, the presented model is adapted to possible modifications in the graph. Moreover, it is possible to solve other related problems with the same structure.
机构:
Texas A&M Univ, College Station,, TX, USA, Texas A&M Univ, College Station, TX, USATexas A&M Univ, College Station,, TX, USA, Texas A&M Univ, College Station, TX, USA
机构:
Univ La Laguna, Dept Matemat Estadist & Invest Operat, San Cristobal La Laguna 38271, Santa Cruz De T, SpainUniv La Laguna, Dept Matemat Estadist & Invest Operat, San Cristobal La Laguna 38271, Santa Cruz De T, Spain
Sedeno-noda, Antonio
Colebrook, Marcos
论文数: 0引用数: 0
h-index: 0
机构:
Univ La Laguna, Dept Ingn Informat & Sistemas, San Cristobal La Laguna 38271, Santa Cruz De T, SpainUniv La Laguna, Dept Matemat Estadist & Invest Operat, San Cristobal La Laguna 38271, Santa Cruz De T, Spain