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

图标索引 历史查询
 

graph-coloring
相关语句
  图着色
     Combining with graph coloring algorithm in graph, we propose a distributed adaptive graph- coloring algorithm based on CSMA protocol to reduce reader collisions in the RFID systems.
     并在CSMA协议的基础上,结合图论中的图着色方法,提出了自适应的图着色算法解决射频识别系统中阅读器冲突。
短句来源
     And if there're multiple candidate banks,which bank should be selected? After integrating these algorithms with the graph-coloring register allocation,authors have implemented a multiple-registerbank register allocator on IXP,which improved the programmability of IXP.
     如果有多个候选组,该选用哪个组等问题的基础上,通过将这些方法与图着色寄存器分配算法相融合,在IXP上实现了这种多寄存器组的寄存器分配,提高了它的可编程性.
短句来源
     This paper introduces MachineSUIF,a compilation research infrastructure,and proposes the implementation instances of several graph-coloring register allocation algorithms and their experimental results. It is emphasized that a flexible and extensible research infrastructure is the important basis for developing complex compilation optimizations rapidly in embedded domain.
     介绍了MachineSUIF编译框架,给出了若干图着色寄存器分配算法在此框架下的工程实现和实验结果,说明了灵活可扩展的编译框架是快速开发复杂的嵌入式环境编译技术的重要基础。
短句来源
  图色
     0n bound of Shen Lin and Irving for a graph-coloring constant
     关于图色常量的Shen Lin和Irving界
短句来源
     Note on graph-coloring constant N((3, 3), 5 )
     关于图色常量N((3,3),5)的结果
短句来源
  相似匹配句对
     [s,t]-GRAPH
     [s,t]-图及其Hamilton性
短句来源
     INFERIOR GRAPH
     下方图形
短句来源
     On D-Cydes in Graph
     关于图中的D—圈
短句来源
     X Graph and Its Properties
     X图及其性质
短句来源
     Graph Coloring Algorithm
     关于图染色的算法
短句来源
查询“graph-coloring”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  graph-coloring
Finally, we further improve the approximation ratio for graph-coloring.
      
In this paper, we survey the main polynomial time approximation algorithms (the ones for which theoretical approximability bounds have been studied) for the minimum graph-coloring and we discuss their approximation performance and their complexity.
      
In the minimum graph-coloring problem we try to color V with as few colors as possible so that no two adjacent vertices receive the same color.
      
Having pointed out that maximum-distance graph-coloring is NP-complete, we develop new, fast approximation algorithms for optimal visual codings.
      
Visual codings for maximum distinction of different objects in displayed images are formulated as a discrete optimization problem of maximum-distance graph-coloring.
      


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 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 问题的时间从指数级变为线性级。

This paper deals with the definition of a class of N×N interconnection networks called combined Delta Network (CDN). For this class of networks the nonbloeking conditions are given. In particular, by means of the graph coloring technique, the minimun number of Delta subnetworks (L) is obtained. A routing algorithm for the establishment of any permutation is also defined.

该又提出了一种组合Delta网(Combination of Delta Network,编写为CDN),并借助图论知识对该网的无阻塞特性进行了论证,给出了构成无阻塞CDN所需Delta子网层数的下限。同时,还确定了建立请求所需连接的路由选择算法。

Based on[1],the frequency distance constrained cochannel/adjacent-channel assignment problern is solved.Futhermore,by using generalized graph coloring models,a generalized algorithm for the frequency distance constrained/frequency constrained channel assignment is presented in this paper.

本文在文献[1]的基础上,解决了发射台非规则分布时同信道频率距离约束和邻信道频率距离约束信道的分配问题。文中,应用图的广义着色模型,给出了更一般的用于频率距离约束和频率约束信道分配的通用算法。

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

 


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

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