图着色

词组短语

graph coloring

与图着色相关的网络例句 [注：此内容来源于网络，仅供参考]

This was done very simply by painting over the current image with the airbrush in color mode.

这一步很简单的，用喷枪工具直接在色彩模式下对当前图着色就可以完成了。

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

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

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

Graph Coloring Problem is one of the typical NP-hard problems in combinatorial optimization problem.

图着色问题（GCP，Graph Coloring Problem）是经典的NP-Hard组合优化问题之一。

Based on these,a novel hybrid genetic algorithm is proposed for the graph coloring problem.The simulation results on ten standard benchmark problems show that the proposed algorithm can obtain good quality solution and it is a potential algorithm for the problem studied.

在此基础上，提出了图着色问题的一种新的混合遗传算法，对10个标准算例的仿真结果表明，新混合遗传算法可以获得问题高质量的解，是一种有潜力的算法。

Times of that of the integer representation. The simulation results on five standard benchmark problems demonstrated the proposed algorithm was effective for the graph coloring problem.

倍。对5个标准图着色问题的仿真结果表明，基于有序划分编码的新算法是求解图着色问题的一种有效的算法。

In order to improve efficiency of making electric power line overhaul plan ,the coloring problem of graph theory is combined to make Liaoning electric power line overhaul plan by using an improved ant colony algorithm.

为了提高制定电力线路检修计划的效率，结合图论中的图着色问题，对辽宁省电力有限公司的线路检修计划进行了制定。

I present cluster schema for combinatorial problem with clustering, design a new crossover operator cluster crossover, study the survival probability of c-schema under c-crossover, apply it successfully to graph coloring, load balancing and maximum spanning tree problems: give measurements of diversity in GA, set up varying crossover probability algorithms to maintain diversity, obtain good results when apply it in avoiding premature convergence and multi-modal functions optimization; establish GAC to be suitable for non stationary function, it can explore the change of environment and find the best solution even for some"anomalous"function.

针对聚类组合优化问题提出了聚类模式，设计了一种新的交换操作：聚类交换并研究了聚类模式在聚类交换操作下的生存可能性，成功的将聚类交换思想和算子应用于图着色、负载平衡和最大生成树问题，佐证了类理论，表明类理论可以指导新的应用算法设计；给出了GA中多样性的度量标准和维护多样性的动态交换概率算法，用于避免过早收敛和多峰函数优化，取得了较好的结果；构造了维持种群多样性以适应动态环境的方法GAC，在某些现有方法无能为力的问题上，GAC能够探测到环境变化，找到当前最优解。

与图着色相关的网络解释 [注：此内容来源于网络，仅供参考]

colorable graph：可着色图

色彩轮 color wheel | 可着色图 colorable graph | 色泄阻 color-bleeding resistance

uniquely colorable graph：唯一可着色图

唯一工作空间 unique working space | 唯一可着色图 uniquely colorable graph | 唯一可译代码 uniquely decipherable code

adaptive degradation：自动降级(制作复杂场景时,设置不同的降级着色模式,加速视 图的操作)

Safe Frames 安全框(安全框显示控制,用来显示电视播放画面的实际尺寸) | Adaptive Degradation 自动降级(制作复杂场景时,设置不同的降级着色模式,加速视 图的操作) | Regions 范围(鼠标热点影响范围控制)

graph coloring：图的着色

5.1 蚁群优化算法蚁群优化算法对于解决货郎担问题并不是目前最好的方法,但首先,它提出了一种解决货郎担问题的新思路;其次由于这种算法特有的解决方法,它已经被成功用于解决其他组合优化问题,例如图的着色(Graph Coloring)以及最短超串(Sh

graph coloring：图着色

路染色:path coloring | 图着色:Graph coloring | 全色数:total coloring

vertices coloring of graph：图的顶点着色

四着色算法:four coloring algorithm | 图的顶点着色:vertices coloring of graph | 分数路染色:fractional path coloring

xeroderma pigmentosum：着色性干皮病

4.着色性干皮病 着色性干皮病(xeroderma pigmentosum)患者皮肤对紫外线特别敏感,易出现多个的皮疹和色素沉着(图4). 患者染色体自发断裂率虽然没有增高. 但在紫外线照射后明显上升,细胞也很容易死亡,存活下来的细胞由于DNA修复酶的缺陷而不能正常修复,

coating paper：着色纸 图画纸

coating operation || 涂渍操作 | coating paper || 着色纸 图画纸 | coating pistol || 涂胶用喷枪

colourable graph：可着色图

colourability || 上染性,染色性 | colourable graph || 可着色图 | colourant || 染色剂,色料,颜料,着色剂

three-colored a graph：三着色图

telephoto lens 长焦镜头 | three-colored a graph 三着色图 | Total Information Awareness 整体情报识别