助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   graph coloring problem (gcp) 的翻译结果: 查询用时:0.007秒
图标索引 在分类学科中查询
所有学科
计算机软件及计算机应用
更多类别查询

图标索引 历史查询
 

graph coloring problem gcp
    很抱歉,暂未找到该词条的译词。
相关语句
  相似匹配句对
     On Some Coloring of Graph
     图的染色
短句来源
     Graph Coloring Algorithm
     关于图染色的算法
短句来源
     [s,t]-GRAPH
     [s,t]-图及其Hamilton性
短句来源
     On the Problem of Some Graph Coloring
     关于若干图类的着色问题
短句来源
     Coloring Problem of Planar Graph
     平面图染色问题的研究
短句来源
查询“graph coloring problem (gcp)”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
没有找到相关例句


A new algorithm called Gene Learning (GL) which is developed from PBIL and Selfish Algorithm is presented in this paper. GL begin with the initial alleles probability of every gene location and followed by a series of repeated processes of sampling, selecting and local search, probability learning until the final result is obtained. Application on graph coloring problem (GCP) is presented in this paper. [

本文在PBIL算法及自私基因算法的基础上,提出一个适应性更广、搜索能力更强的优化搜索算法:基因学习算法。该算法从各基因位的初始等位基因概率出发,通过一系列的概率采样、群体选择与局部搜索、概率学习等操作,逐步缩小概率搜索空间,直至收敛。本文将该算法用于求解图的着色问题,取得了非常好的结果

Graph Coloring problem (GCP) is an NP hard problem. Solving GCP by heuristic local search algorithm has received a lot of attention in the last few years. Among them GSAT is the most famous one. Various local search algorithms incorporate schemes that enhance local search to escape from local minima. Weight-learning is one of the most widely adopted method. The SWLA , which is a general algorithm abstracted from some Weight-learning local search algorithms by us, can solve...

Graph Coloring problem (GCP) is an NP hard problem. Solving GCP by heuristic local search algorithm has received a lot of attention in the last few years. Among them GSAT is the most famous one. Various local search algorithms incorporate schemes that enhance local search to escape from local minima. Weight-learning is one of the most widely adopted method. The SWLA , which is a general algorithm abstracted from some Weight-learning local search algorithms by us, can solve combinatorial optimization problem effectively. The MCWLA presented in this paper is an extension of GSAT and SWLA for GCP,which use "Weight Crossover" operator and "restore strategy" to avoid the inefficiency during later local search period. The performance of the MCWLA is efficient in solving some difficult GCP benchmarks. Moreover, the algorithm can find the optimal solution while GSAT and SWLA can not.

图着色问题 (GCP)是 NP完全问题 .近年来求解 GCP的启发式局部搜索算法引起人们的关注 ,GSAT是最著名的局部搜索算法之一 .许多局部搜索算法引入跳出局部极小的机制来提高搜索效率 ,权值学习是一种被广泛采用的方式之一 .我们从一些权值学习局部搜索算法抽象出一个通用的权值学习算法 (SWL A) ,进一步把 SWL A和 GSAT相结合提出了最小冲突权值学习算法 (MCWL A) ,算法还应用还原策略和“权值交叉”算子来提高搜索后期的效率 .算法在求解一些难解测试范例时显示出较高的效率 ,能求得 GSAT及 SWL A无法求得的最优解 .

Ant Algorithm is a novel simulated evolutionary algorithm which was proposed first by M.Dorigo and had been applied to Traveling Salesman Problems (TSP) with great success. Later, the algorithm has been applied to other combinatorial optimization problems such as Quadratic Assignment Problem (QAP), Vehicle Routing Problem (VRP), Graph Coloring Problem (GCP) and Network Routing Problem (NRP) etc.. It has been proved that Ant Algorithm has the characteristics...

Ant Algorithm is a novel simulated evolutionary algorithm which was proposed first by M.Dorigo and had been applied to Traveling Salesman Problems (TSP) with great success. Later, the algorithm has been applied to other combinatorial optimization problems such as Quadratic Assignment Problem (QAP), Vehicle Routing Problem (VRP), Graph Coloring Problem (GCP) and Network Routing Problem (NRP) etc.. It has been proved that Ant Algorithm has the characteristics of strong robustness, good convergence and versatility but at the same time has some shortcomings such as needing longer computing time and easy to enter stagnation.

蚂蚁算法是由意大利学者M.Dorigo等人提出的一种新型的模拟进化算法。该算法首先应用于旅行商问题并获得了极大的成功,其后,又被用于求解指派问题、Job-shop调度问题、图着色问题和网络路由问题等。实践证明,蚂蚁算法是一种鲁棒性强、收敛性好、实用性广的优化算法,但同时也存在一些不足,如收敛速度慢和容易出现停滞现象等。

 
<< 更多相关文摘    
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关graph coloring problem (gcp)的内容
在知识搜索中查有关graph coloring problem (gcp)的内容
在数字搜索中查有关graph coloring problem (gcp)的内容
在概念知识元中查有关graph coloring problem (gcp)的内容
在学术趋势中查有关graph coloring problem (gcp)的内容
 
 

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