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

图标索引 历史查询
 

graph coloring problem
    很抱歉,暂未找到该词条的译词。
相关语句
  “graph coloring problem”译为未确定词的双语例句
     Applying Gene Learning Algorithm in Solving Graph Coloring Problem
     基因学习算法解图的着色问题
短句来源
     The graph coloring problem (GCP) is a widely studied combinatorial optimization problem.
     图的着色问题是一个被广泛研究的组合优化问题。
短句来源
     In this paper we conduct a research on the basic theory of genetic algorithm and present some effective algorithms on the graph coloring problem.
     本文将对遗传算法的基础理论进行研究,并提出一些有效的算法用于解决图的着色问题。
短句来源
     In this section, we present a method that breaks the symmetry of the graph coloring problem by matrix transformation and provide a improved general standard of genetic algorithms which can be used to solve many problems with a highly symmetric solution space .
     本文提出利用矩阵变换的方法解决冗余数据带来的交叉算子失效问题,并给出一种改进的通用遗传算法标准用于解决一类具有编码冗余问题的例子。
短句来源
     So, we present group genetic algorithms (GGA) to solve the graph coloring problem.
     因此提出利用分组遗传算法的不定长分组编码方式来彻底解决编码冗余问题。
短句来源
更多       
  相似匹配句对
     Graph Coloring Algorithm
     关于图染色的算法
短句来源
     On Some Coloring of Graph
     图的染色
短句来源
     On the Problem of Some Graph Coloring
     关于若干图类的着色问题
短句来源
     [s,t]-GRAPH
     [s,t]-图及其Hamilton性
短句来源
     Coloring Problem of Planar Graph
     平面图染色问题的研究
短句来源
查询“graph coloring problem”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  graph coloring problem
The paper discusses a possible solution approach which leads to a combined bin packing/graph coloring problem.
      
By reducing the allocation problem to a variant of the graph coloring problem, we show that the global optimization problem is NP-hard, and provide a general approximation methodology through vertex labeling.
      
In this paper, a new 0-1 integer programming formulation for the graph coloring problem is presented.
      
Two Novel Evolutionary Formulations of the Graph Coloring Problem
      
In this paper, we present such hybrid algorithms for the graph coloring problem.
      
更多          


The register allocation can be considered as a graph coloring problem.Every node in the graph stands for candidates of the register,and two nodes areconnected by an edge if two candidates interfere with each other,i.e.they livesimultaneously at certain points in the objective program.This paper presents aalgorithm for the MODULA-2 compiler“Register Allocation by Priority-basedcoloring”in VAX-11/VMS.As for time,the above algorithm enables the process ofthe spilling problem to run in the linear...

The register allocation can be considered as a graph coloring problem.Every node in the graph stands for candidates of the register,and two nodes areconnected by an edge if two candidates interfere with each other,i.e.they livesimultaneously at certain points in the objective program.This paper presents aalgorithm for the MODULA-2 compiler“Register Allocation by Priority-basedcoloring”in VAX-11/VMS.As for time,the above algorithm enables the process ofthe spilling problem to run in the linear level,rather than the exponential level.

寄存器分配可看作为一个图着色问题,图中每个结点代表了一个硬件寄存器的候选者,如果两个候选者使用寄存器发生冲突则两者之间有一条边,即它们同时在某些点活跃。本文提出了在VAX-11/VMS 机器上实现MODULA-2编译中使用的基于优先级着色的寄存器分配算法。使得图着色寄存器分配中处理Spilling 问题的时间从指数级变为线性级。

In this paper,we present a graph simplifying method which is fit for graph coloring problem. In this method,each node is deleted whenever its degree in the attained graph is less than a certain value. When graph coloring algorithms are combined with this simpliying method, their performances can be improved. We also exploit the schemes of setting the value and combining this method with GAs, and show the promising results of the simulation. Finally, it is pointed out that the method is...

In this paper,we present a graph simplifying method which is fit for graph coloring problem. In this method,each node is deleted whenever its degree in the attained graph is less than a certain value. When graph coloring algorithms are combined with this simpliying method, their performances can be improved. We also exploit the schemes of setting the value and combining this method with GAs, and show the promising results of the simulation. Finally, it is pointed out that the method is also fit for other graph problems such as the largest clique, maximum independent set, etc.

本文提出了一种适用于图着色问题求解的图简化方法.在这种图简化方法中,图中度小于某个特定值的节点不断被去掉,把这种方法与各种图着色算法结合使用,能提高这些算法的效率.文中分析了应如何设定其特定值,并着重叙述了与遗传算法的混合运用.最后在给出仿真结果的同时,进一步指出了本方法同样适用于求最大全连接子图等其它图论问题.

This paper discusses the shortcomings of General S imulated Annealing, and then puts forward a fast simulated annealing algorithm. At last the algorithm is used for solving graph coloring problem. The experiment al data indicate that synthetic performance of new algorithm is rather good.

本文首先讨论了一般的模拟退火算法的优缺点,提出了一个快速的单元自退火算法,并将其用于解决图的着色问题,结果表明新算法的综合性能良好。

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

 


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

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