A Shortest-path Routing Based on Ant Algorithm
被引量：1
A Shortest-path Routing Based on Ant Algorithm
出处
《通讯和计算机（中英文版）》
2005年第9期67-69,74,共4页
Journal of Communication and Computer
Ant Algorithm
The Shortest-path
Routing
-
1LIU Longcheng HE Yong.Inverse minimum spanning tree problem and reverse shortest-path problem with discrete values[J].Progress in Natural Science:Materials International,2006,16(6):649-655.
-
2Wang Honggang Ma Liang Zhang Huizhen Li Gaoya.Quantum-inspired ant algorithm for knapsack problems[J].Journal of Systems Engineering and Electronics,2009,20(5):1012-1016. 被引量：3
-
3王金兰.网络路径选择与路由协议的比较研究[J].南方职业教育学刊,2013,3(2):5-8.
-
4田丰.Windows Server 2003下的OSPF[J].网管员世界,2006(7):145-146.
-
5贺怀清,杨国鑫,李建伏.基于CUDA的并行联程路径搜索算法[J].智能计算机与应用,2013,3(1):29-32.
-
6MISHRAP.K..Optimal parallel algorithm for shortest-paths problem on interval graphs[J].Journal of Zhejiang University Science,2004,5(9):1135-1143.
-
7YU Jianping,LIN Yaping,LIN Mu,YI Yeqing.Multi-Constrained Anycast Routing Based on Ant Algorithm[J].Chinese Journal of Electronics,2006,15(1):133-137. 被引量：4
-
8赵清泉.OSPF路由协议深入解析[J].科技传播,2011,3(21):168-169.
-
9杨锋,彭勤科,徐涛.基于随机网络的在线评论情绪倾向性分类[J].自动化学报,2010,36(6):837-844. 被引量：9
-
10鄢腊梅,袁友伟.瓦楞辊的齿形设计及专家系统的开发与应用[J].机械设计与制造工程,2000,29(6):9-10.
