您当前的位置:
首页 >
文章列表页 >
An Almost Everywhere Strong Convergence Proof for a Class of Ant Colony Algorithms
更新时间:2025-07-16
    • An Almost Everywhere Strong Convergence Proof for a Class of Ant Colony Algorithms

    • Acta Electronica Sinica   Vol. 37, Issue 8, Pages: 1646-1650(2009)
    • CLC: TP301
    • Published:2009

    移动端阅览

  • SU Zhao-pin, JIANG Jian-guo, LIANG Chang-yong, et al. An Almost Everywhere Strong Convergence Proof for a Class of Ant Colony Algorithms[J]. Acta Electronica Sinica, 2009, 37(8): 1646-1650. DOI:

  •  
  •  
icon
试读结束,您可以激活您的VIP账号继续阅读。
去激活 >
icon
试读结束,您可以通过登录账户,到个人中心,购买VIP会员阅读全文。
已是VIP会员?
去登录 >

0

Views

1075

下载量

14

CSCD

Alert me when the article has been cited
提交
Tools
Download
Export Citation
Share
Add to favorites
Add to my album

Related Articles

Reliability Analysis of Combined Hardware/Software System Based on Markov Process
An Improved Ant Colony Optimization for Two-Sided Assembly Line Balancing Problem
Swarm Intelligence Theory and Applications
GCTA:A Group Command Transmission Algorithm

Related Author

BR
QIAN Qing-quan
HE Zheng-you
YU Min
WEI Wei
LUO Xiao-ping
ZHENG Qiao-xian
TANG Qiu-hua

Related Institution

Zhejiang University City CollegeZhejiangHangzhou 310015China
College of Electrical EngineeringZhejiang UniversityHangzhouZhejiang 310027China
Zhejiang University City College
College of Electrical Engineering, Zhejiang University
College of Mathematic and Computer Science, Hubei University
0