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

图标索引 历史查询
 

np-完全
相关语句
  “np-完全”译为未确定词的双语例句
    SOLUTION OF A CLASS OF NP-C PROBLEMS IN THRESHOLD GRAPH
    一类NP-完全问题在阈图上的解
短句来源
    Placer is to find appropriate place in reconfigurable devices and loader is to do the reconfiguration for hardware tasks.
    软件任务调度算法是进行嵌入式系统综合时,确保系统实现性能目标的一个关键问题,这是一个NP-完全问题。
短句来源
    In this paper, an optimal-task-scheduling problem is presented along with a heuristic algorithm for it.
    本文提出一个NP-完全的任务调度问题,并采用人工智能启发式搜索算法求解。
短句来源
    In this paper we give a brief description of the realization methods of DNA computation, and then introduce several models of SAT problem based on DNA computing particularly according to the test tube and surface based fashion.
    DNA计算是一种新的计算方式 ,其高度并行性和巨大的信息存储容量为 NP-完全问题的解决提供了一种全新的方法 .
短句来源
查询“np-完全”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  np-completeness
We prove the NP-completeness of the solvability problem in a free semigroup for equations of the formw(x1,...,xn)=g, wherew(x1,...,xn) is a semigroup word in the alphabet of unknowns andg is an element of a free semigroup.
      
A joint signature, entyption and error correction public-key cryptosystem is presented based on an NP-completeness problem-the decoding problem of general linear codes in algebraic coding theory.
      
The property of NP-completeness of topologic spatial reasoning problem has been proved.
      
The proof for the property of NP-completeness in directional spatial reasoning problem is based on two important transformations.
      
The NP-completeness of state safety (is there a sequence of state transitions leading to the empty state?) implies that a correct and scalable SCP will reject some safe states.
      
更多          


The research on the theory of NP-completeness is a new topic appeared in mathematics and comPuterscie.ace areas in the early 1970's, and is PerhaPs the most important theoritical development in algorithms research in the Past decade. Firstly, the article briefly introduces the concept of NP-comPlete Problem and other relative concepts and theory. Then, it gives several basic and Practical examPles of NP-complete Problems. Finally, the article discusses the significance of researching into the theory of NP-completeness....

The research on the theory of NP-completeness is a new topic appeared in mathematics and comPuterscie.ace areas in the early 1970's, and is PerhaPs the most important theoritical development in algorithms research in the Past decade. Firstly, the article briefly introduces the concept of NP-comPlete Problem and other relative concepts and theory. Then, it gives several basic and Practical examPles of NP-complete Problems. Finally, the article discusses the significance of researching into the theory of NP-completeness.

关于NP-完全性理论的研究是七十年代初在数学和计算机科学领域里出现的一个新课题,也是近十几年来在算法理论研究中取得的重大成果。本文试图对NP-完全问题以及有关概念和理论做一粗浅的介绍,并给出几个较基本、通俗的NP-完全问题实例。最后,文章着重指出了研究NP-完全性理论的意义。

To select a suitable time in the timetable of the university is in nature how to find a common free time set of classrooms, teachers and classes. In 1975 Itai and Shamir proved that the timetable problem also is a NP-Complete problem. There had been a lot of heated arguments among many scholars until then. We can divide the timetable problem into two layers to solve. At first we should select a suitable time slice, and then according to the time slice we proceed to schedule the classrooms. But classroom-schedulings...

To select a suitable time in the timetable of the university is in nature how to find a common free time set of classrooms, teachers and classes. In 1975 Itai and Shamir proved that the timetable problem also is a NP-Complete problem. There had been a lot of heated arguments among many scholars until then. We can divide the timetable problem into two layers to solve. At first we should select a suitable time slice, and then according to the time slice we proceed to schedule the classrooms. But classroom-schedulings are greatly different in various universities. Is this paper we will particularly deal with problem about how to select a suitable time-slice according to the safety decision-making principle. When we select a time slice for every course, we must consider the minimum influence upon successive courses. If a teacher will teach two courses which correspond two classes in a semester, when we select the time slice of the first course, we should try our best to select the time slice when the second class already has another course. In such a case when we select the time slice of the second course, the freedom of the selection would not be hindered by the first selection. If a class has two courses taught by two teachers in a semester, we must consider the problem in the similar way. As we select the slice in such a way, the possibility of collision would greatly decrease. Here we present the quantified description of the safety decision-making scheduling algorithm. In order to speed up scheuling process, when we input the course tuples, we put the course tuples with the same teacher and the same class together. We should only scan downward several courses, and then we can make our decision accordingly. Other courses are irrelevant In this paper we draw the algorithm flow-chart. The program has been run in the IBM-PC. It has turned out that to select a suitable time slice is fully probable.

排课表程序中选择合适时间的问题,其本质上是寻找教室、教师和学生班级的公共有空集合,1975年Itai及Shamir证明了课程表问题也是一个NP-完全类问題。从而结束了该问题上很多学者之间的论争。可把排课表问题分成两个层次进行,首先选择合适时间,然后再根据这个时间进行教室调度。而教室调度在各类学校是大不相同的,本文着重讨论了根据安全决策准则来选择合适时间片。其出发点是在为每一门课程选择时间时,要考虑对后续课影响最小,如一位教师一学期讲两门课(相应有两个班级),选第一门课时间时,尽可能选第二门课这个班级在上别的课的时间,这样在选第二门课的时间时,其选择自由度不受第一门课的影响。如一个班级同时接受两位教师讲两门课,其考虑的出发点也同样。这样来选择时间,以后造成冲突的可能性大大减少。本文给出了安全决策调度算法的定量描述,为加快安全决策调度过程,在原始输入课元组时,把相同的教师及相同的班级的课元组放在一起,只要往下扫描几门课。根据这几门课便可进行决策,再以后的课全是无关联的。本文也给出了算法框图。经在IBM-PC机上运行,证明选择合适时间片是完全可行的。

PLA folding minimizes the silicon area of PLA. In this paper, a logical synthesis algorithm for PLA folding and a heuristic algorithm for mixed row and column PLA folding are presented.

本文提出了面向PLA折迭的逻辑化简技术和一个PLA行、列混合折迭算法,PLA折迭是通过使两个逻辑信号共享阵列中的一行或一列,以减少硅片面积,为了提高PLA的折迭效率,必须在逻辑设计过程中就考虑到折迭的因素,使得既在逻辑上化简,又便于PLA折迭,本文在经典的逻辑最小化基础上,提出了一个面向PLA折迭的逻辑化简算法,已经知道PLA折迭问题是NP完全的,所以要找一个多项式复杂度的最优化算法是不可能的,我们提出一个行、列混合折迭的启发式算法,可以快速地求得PLA折迭的近似最优解。一些实例表明它优于现存的行、列单独折迭算法。

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

 


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

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