助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   state transition rule 在 数学 分类中 的翻译结果: 查询用时:0.402秒
图标索引 在分类学科中查询
所有学科
数学
自动化技术
电力工业
更多类别查询

图标索引 历史查询
 

state transition rule
相关语句
  状态转移规则
    The ant colony system is introduced and a new algorithm for TSP is presented. This algorithm is a distributed parallel algorithm with a new state transition rule and new global updating rule.
    从介绍蚂蚁系统出发,提出了新的状态转移规则及全局修正规则,结合这些新规则设计出一个新算法,该算法是一个分布式并行算法。
短句来源
查询“state transition rule”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  state transition rule
Based on the state transition rule, the local updating rule and the global updating rule of ant colony algorithm, we propose an improved ant colony algorithm of the least-cost quality of service (QoS) unicast routing.
      
One final modification must be made to the state transition rule.
      
Non-uniform CA differ from their uniform counterpart in the state transition rule diversity exhibited by the non-uniform ones.
      


The ant colony system is introduced and a new algorithm for TSP is presented. This algorithm is a distributed parallel algorithm with a new state transition rule and new global updating rule. Experiment results demonstrate that the algorithm is powerful and effective.

从介绍蚂蚁系统出发,提出了新的状态转移规则及全局修正规则,结合这些新规则设计出一个新算法,该算法是一个分布式并行算法。计算机试验结果表明,该算法对求解TSP问题十分有效。

Ant Colony Optimization(ACO)algorithm is a kind of meta-heuristic algorithm for solving NP-hard problems.Using positive feedback and parallel-computing principle,it has strong capability to explore solution.Recently,ACO algorithm is widely used to study TSP problems.This paper proposes Branching Ant Colony with Dynamic Perturbation(DPBAC)algorithm,which improves traditional ACO algorithm in 5 aspects:introducing Branching Method to choose starting points,improving state transition rules,introducing Mutation...

Ant Colony Optimization(ACO)algorithm is a kind of meta-heuristic algorithm for solving NP-hard problems.Using positive feedback and parallel-computing principle,it has strong capability to explore solution.Recently,ACO algorithm is widely used to study TSP problems.This paper proposes Branching Ant Colony with Dynamic Perturbation(DPBAC)algorithm,which improves traditional ACO algorithm in 5 aspects:introducing Branching Method to choose starting points,improving state transition rules,introducing Mutation Method to shorten tours,improving pheromone updating rules and introducing Conditional Dynamic Perturbation Method.Showed by simulated experiments,DPBAC algorithm can improve the shortcomings,as costing too much time and tending to stick in local minimum and so on,of traditional ACO algorithm.

蚁群优化算法是一种求解组合优化难题的强启发式算法,它利用正反馈和并行计算原理,具备很强的搜索能力。近年来,蚁群优化算法广泛应用于TSP问题的研究。本文提出分支蚁群动态扰动(DPBAC)算法,该算法主要从5个方面对基本蚁群算法做出改进:引入分支策略选取出发城市;改进状态转移规则;引入变异策略改进蚂蚁路径;改进信息素更新规则;引入条件动态扰动策略。实验表明,该算法可以有效改善基本蚁群算法搜索时间较长、容易陷入局部极小等缺点。

 
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关state transition rule的内容
在知识搜索中查有关state transition rule的内容
在数字搜索中查有关state transition rule的内容
在概念知识元中查有关state transition rule的内容
在学术趋势中查有关state transition rule的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社