| 一种基于脉冲耦合神经网络的最短路径算法 |
| |
| 引用本文： | 纪其进.一种基于脉冲耦合神经网络的最短路径算法[J].小型微型计算机系统,2005,26(5):826-829. |
| |
| 作者姓名： | 纪其进 |
| |
| 作者单位： | 东南大学,计算机网络和信息集成技术教育部重点实验室,江苏,南京,210096 |
| |
| 基金项目： | 江苏省自然科学基金项目 (BK2 0 0 12 0 5 )资助，国家自然科学基金项目 (NSF90 10 40 0 9)资助 |
| |
| 摘 要： | 提出了一种基于脉冲耦合神经网(Pulse—Coupled Neural Network，PCNN)的最短路径算法。通过对PCNN做很小的改变，该算法不但具有和Hopfield神经网络相同的并行处理特性，适用于求解大规模实时问题，而且还能一次求出源点到其它所有目的点的最短路径．根据PCNN的模型和运算规则，本文证明了该方法的正确性并分析了其复杂度．文中还将该算法运用于通信网络的路由选择．
|
| 关 键 词： | 最短路径算法 脉冲耦合神经网络 网络路由选择 |
| 文章编号： | 1000-1220(2005)05-0826-04 |
Shortest-Path Algorithm Using Pulse-Coupled Neural Networks |
| |
| JI Qi-jin.Shortest-Path Algorithm Using Pulse-Coupled Neural Networks[J].Mini-micro Systems,2005,26(5):826-829. |
| |
| Authors: | JI Qi-jin |
| |
| Abstract: | Proposed shortest-path algorithm using slightly modified Pulse-Coupled Neural Network. While sharing the same advantages of parallel processing with Hopfield neutral networks, this algorithm aims to large-scale real time problem and can get shortest paths from source to all the destinations in a graph in one time computation. We validate the algorithm by proving and analyze its complexity according its basic model and computing rules. An application of this algorithm to network path selection is also illustrated in the paper. |
| |
| Keywords: | shortest-path algorithm pulse-coupled neural networks network path selection |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
