查询词典 map coloring problem

Now there are some special algorithms such as Genetic Algorithm, Neural Network and Simulated Annealing Algorithms are effective ways to solve NP-complete problem. However, in the case of larger scale, especially in the studying of strong vertex-distinguishing total coloring for complete graph, they will show some of the inevitable shortcomings.

现已有一些经典算法如遗传算法、神经网络、模拟退火算法等是求解这类NP完全问题的有效方法，但在规模增大的情况下，特别是在完全图的点可区别强全染色的应用中，它们会表现出一些不可避免的缺陷。

Compared with the existing DNA algorithm for graph coloring problem,the proposed algorithm is of lower complexity.

与已有求解图着色问题的DNA算法相比，新的算法具有较低的复杂性。

In this paper we conduct a research on the basic theory of genetic algorithm and present some effective algorithms on the graph coloring problem.

本文将对遗传算法的基础理论进行研究，并提出一些有效的算法用于解决图的着色问题。

Because graph coloring problem belongs to NP complete problems, it can not get the optimal solution in polynomial time.

由于图的着色问题属于NP完全问题，不可能在多项式时间内得到最优解。

Matlabf programming is usually used to solve the graph coloring problem, frequent use of this principle.

详细说明：用matlabf编程求解通常的图着色问题，经常使用这个原理的。

A novel encoding scheme was presented to solve the redundancy of the integer representation for the graph coloring problem.

针对整数编码的冗余性，提出了求解图着色问题的一种新的编码方式。

Graph coloring problem is a NP-complete one of graph and combinatorial optimization.

图着色问题是图与组合优化中的一个NP-完全问题。

So, we present group genetic algorithms to solve 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 .

本文提出利用矩阵变换的方法解决冗余数据带来的交叉算子失效问题，并给出一种改进的通用遗传算法标准用于解决一类具有编码冗余问题的例子。

This behavior is simple and efficient, but may destory the solving trajectory. In order to improve the performance of the system, we introduce the notion of agent compromise in distributed graph coloring problem solving with ERA.

为提高系统的求解性能，我们在求解分布式着色问题时，引入了agent妥协，通过妥协agent的行为，给难以确定赋值的主要变量赋值，从而实现求解性能的提高。

When this condition occurs, inbound replication with the source partner is stopped on the destination domain controller and event ID 2042 is logged in the Directory Services event log.

计算机密码学是研究计算机信息加密、解密及其变换的科学，是数学和计算机的交义学科，也是一门新兴的学科。

Instructions: click on the thumbnails to see a larger image, then use the left-right arrow keys to scroll through the slideshow.

使用说明：滑鼠点在小图上即可放大观赏。开启后键盘左右键可用来换照片。