Neural implementation of Dijkstra's algorithm.

被引:0
|
作者
Mérida-Casermeiro, E
Muñoz-Pérez, J
Benítez-Rochel, R
机构
[1] Univ Malaga, Dept Matemat Aplicada, E-29071 Malaga, Spain
[2] Univ Malaga, Dept Ciencias Computac, E-29071 Malaga, Spain
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
下载
收藏
页码:342 / 349
页数:8
相关论文
共 50 条
  • [41] ARC CLIPPING ALGORITHM.
    Anon
    IBM technical disclosure bulletin, 1986, 28 (10): : 4570 - 4574
  • [42] SDMRU - A PAGING ALGORITHM.
    Arora, R.
    Subramanian, R.K.
    Australian Computer Journal, 1979, 11 (04): : 122 - 126
  • [43] EFFICIENT ROUTING ALGORITHM.
    Shi, Kai-jian
    Zhu Hong-e
    CAD Computer Aided Design, 1987, 19 (07): : 375 - 379
  • [44] A VLSI PARTITION ALGORITHM.
    Huang, Shou-Hsuan Stephen
    BIT (Copenhagen), 1988, 28 (02): : 215 - 226
  • [45] COHERENT PERTURBATION ALGORITHM.
    Davis, Richard M.
    Farden, David C.
    Sher, Patrick J.-S.
    IEEE Transactions on Antennas and Propagation, 1986, AP-34 (03) : 380 - 388
  • [46] ADAPTIVE ESTIMATION ALGORITHM.
    Sastri, T.
    IIE Transactions (Institute of Industrial Engineers), 1988, 20 (02): : 176 - 185
  • [47] DOMINATORS AND THE CUTTING ALGORITHM.
    Anon
    IBM technical disclosure bulletin, 1985, 28 (03): : 1201 - 1203
  • [48] EXCLUSIVE OR REDUCTION ALGORITHM.
    Anon
    1600, (29):
  • [49] UNIFORM HASHING ALGORITHM.
    Arnold, R.F.
    Bass, W.E.
    Hartung, M.H.
    Snow, F.D.
    Stephens III, R.D.
    1600, (16):
  • [50] A biobjective Dijkstra algorithm
    Sedeno-noda, Antonio
    Colebrook, Marcos
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 276 (01) : 106 - 118