 全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多   graph coloring problem 在 计算机软件及计算机应用 分类中 的翻译结果: 查询用时：0.069秒 在分类学科中查询 所有学科 计算机软件及计算机应用 自动化技术 更多类别查询 历史查询  graph coloring problem 图着色问题(7)图着色问题(7)图着色问题(7)  图着色问题
 New Algorithms for Graph Coloring Problem 求图着色问题的新算法 短句来源 Graph Coloring problem (GCP) is an NP hard problem. 图着色问题 (GCP)是 NP完全问题 . 短句来源 A Min-conflict Weight-learning Algorithm for Graph Coloring Problem 图着色问题的一个最小冲突权值学习算法 短句来源 It was first proposed by Dorigo in 1991. From then on, ACO has been successfully used to solve a series of combinatorial problems, such as: Traveling Salesman Problem, Quadratic Assignment Problem, Vehicle Routing Problem, Graph Coloring Problem and so on. 它由意大利学者Dorigo于1991年首次提出,并最初被用于求解旅行商问题。 在从1991年至今近十五年的时间里,蚁群优化被成功地用于求解一系列NP完全的组合优化问题,如:旅行商问题、二次分配问题、车辆寻路问题和图着色问题等等。 短句来源 The graph coloring problem is a well-known NP-complete problem. 图着色问题是著名的NP-完全问题。 短句来源 更多 图着色问题
 New Algorithms for Graph Coloring Problem 求图着色问题的新算法 短句来源 Graph Coloring problem (GCP) is an NP hard problem. 图着色问题 (GCP)是 NP完全问题 . 短句来源 A Min-conflict Weight-learning Algorithm for Graph Coloring Problem 图着色问题的一个最小冲突权值学习算法 短句来源 It was first proposed by Dorigo in 1991. From then on, ACO has been successfully used to solve a series of combinatorial problems, such as: Traveling Salesman Problem, Quadratic Assignment Problem, Vehicle Routing Problem, Graph Coloring Problem and so on. 它由意大利学者Dorigo于1991年首次提出,并最初被用于求解旅行商问题。 在从1991年至今近十五年的时间里,蚁群优化被成功地用于求解一系列NP完全的组合优化问题,如:旅行商问题、二次分配问题、车辆寻路问题和图着色问题等等。 短句来源 The graph coloring problem is a well-known NP-complete problem. 图着色问题是著名的NP-完全问题。 短句来源 更多 图着色问题
 New Algorithms for Graph Coloring Problem 求图着色问题的新算法 短句来源 Graph Coloring problem (GCP) is an NP hard problem. 图着色问题 (GCP)是 NP完全问题 . 短句来源 A Min-conflict Weight-learning Algorithm for Graph Coloring Problem 图着色问题的一个最小冲突权值学习算法 短句来源 It was first proposed by Dorigo in 1991. From then on, ACO has been successfully used to solve a series of combinatorial problems, such as: Traveling Salesman Problem, Quadratic Assignment Problem, Vehicle Routing Problem, Graph Coloring Problem and so on. 它由意大利学者Dorigo于1991年首次提出,并最初被用于求解旅行商问题。 在从1991年至今近十五年的时间里,蚁群优化被成功地用于求解一系列NP完全的组合优化问题,如:旅行商问题、二次分配问题、车辆寻路问题和图着色问题等等。 短句来源 The graph coloring problem is a well-known NP-complete problem. 图着色问题是著名的NP-完全问题。 短句来源 更多 查询“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－中国知网 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社