期刊
NEUROCOMPUTING
卷 72, 期 10-12, 页码 2331-2336出版社
ELSEVIER
DOI: 10.1016/j.neucom.2008.12.008
关键词
Competitive pulse coupled neural network; Shortest path tree; Algorithm; Routing
资金
- Natural science Foundation of Yunnan Province, China [2005F0010M, 2007F174M]
- Youth Fund of Yunnan University, China [2007Qo24C]
The characteristics of pulse wave propagation of competitive pulse coupled neural network (CPCNN) are analyzed for the solution of the network shortest routing. The setting terms of the neuron parameters for the pulse wave propagation along the routing of the shortest path tree (SPT) of the network routing graph are educed. The simulation results show that the proposed method is an effective algorithm when the network routing graph holds many nodes. With the nodes number of the network increasing, the number of iterations of our algorithm will basically hold the line. The method shows better computational performance and dominance. Crown Copyright (c) 2009 Published by Elsevier B.V. All rights reserved,
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据