着色

International Corporation "Ford" has chosen JSC "Bor Glassworks" as the only automotive glass supplier for its plants. JSC "Bor Glassworks" supplies tinted glass for side glazing of car model "Ford Focus", assembled near Saint Petersburg.

为国际合作，福特公司选择了鲍尔玻璃公司做为他的供应商，鲍尔玻璃公司为福特Focus车侧窗供应着色玻璃，在 Saint Petersburg安装。

Then, based on the complexity of the color match requirements, a new coloring graph structure is presented.

接着， 针对颜色匹配的复杂情况，提出新的着色图构造。

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.

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

The graph coloring problem is a widely studied combinatorial optimization problem.

图的着色问题是一个被广泛研究的组合优化问题。

Graph coloring problem, you can use four kinds of colors to a different places on the map with different colors, and no more than four colors.

详细说明：图的着色问题，可以使用四种颜色给一个地图上的不同地方着上不同的颜色，并且不超过四种颜色。

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-完全问题。

Now, however, all children continue in "comprehensive" schools, and the eleven-plus determines which courses of study the child will follow.

然而现在，所有的孩子都要在综合学校继续学习，所以这次考试只是决定他们将要学习哪些课程。

Cultivatable land , and led to a general recognition that development must not be carried at the cost of agriculture .

城区的迅速扩大在很多情况下侵占了宝贵的可耕地，使人们普遍认识到发展不能以牺牲农业为代价。