助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   strong np 的翻译结果: 查询用时:0.182秒
图标索引 在分类学科中查询
所有学科
更多类别查询

图标索引 历史查询
 

strong np
相关语句
  强np
     It was concluded that the problem is strong NP complete without any approximate algorithms that had constant polynomial time approximate ratio.
     阐述了多任务的资源调度问题的形式化定义、复杂性和可近似性难度分析,证明了该问题是NP完全的且是强NP完全的,不存在任何常数近似比的多项式时间近似算法.
短句来源
     The question of multi task scheduling is a strong NP problem. Its algorithm study is an important research object. Today in the field of AI and distributed conditions,the research of intelligent agent and its application possess research value.
     任务调度问题是一个强NP难题,算法研究是它的一个重要研究方向,智能Agent技术研究和应用开发在AI领域和分布环境下更具研究价值。
短句来源
  相似匹配句对
     ,…,Np(.)
     ,…,Np(.)
短句来源
     On the Issue of P and NP
     谈谈P和NP问题
短句来源
     We show that the scheduling problem is NP hard in the strong sense.
     本文证明了上述排序模型是强 NP困难的
短句来源
     THE BONE IS STRONG
     岁月流逝 骨不更年
短句来源
     strong positive.
     强阳性(++),积分>4分。
短句来源
查询“strong np”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  strong np
As a consequence, we show strong NP-hardness of a number of similar problems, including a severely restricted version of the Numerical 3-Dimensional Matching problem.
      
In this paper, we first present a strong NP-hardness result of the problem.
      
The P-2 epitope was demonstrated in 13, the NP-1 epitope in 12, the P-3 epitope in 9, and the P-1 epitope in 3 brains, but staining was severely reduced compared with the NP-2 epitope and restricted to areas with strong NP-2 expression.
      
Mice primed and boosted once with a plasmid encoding the full-length NP gene, pCMV/NP, but not with the minigene pCMV/NPep, developed a strong NP(147-155)-specific CTL response within 2 weeks after the boost.
      
In this paper, we give proofs for the strong NP-hardness of the two problems.
      
更多          


The multimedia temporal relationship is transformed into a weighted bi directional graph model and the multimedia temporal synchronization problems are regarded as the buffer assignment problems.Since the buffer assignment problem belongs to the strong NP completeness,vertex deletion and graph decomposition approaches are proposed to solve efficiently the multimedia temporal synchronization problem.

文中将多媒体时间同步问题转化为一个有向带权图的平衡权值分配问题.针对这样一个强NP类难解问题,提出了节点删除法和图分解法来处理原始图,尽可能地降低计算复杂性,从而有效地解决多媒体时间同步问题.

In this paper, single machine scheduling problems with variable processing time is discussed according to published instances of management engineering. Processing time of a job is the product of a “coefficient" of the job on position i and a “normal" processing time of the job. The criteria considered is to minimize scheduled length of all jobs. A lemma is proposed and proved. In no deadline constrained condition, the problem belongs to polynomial time algorithm. It is proved by using 3 partition that...

In this paper, single machine scheduling problems with variable processing time is discussed according to published instances of management engineering. Processing time of a job is the product of a “coefficient" of the job on position i and a “normal" processing time of the job. The criteria considered is to minimize scheduled length of all jobs. A lemma is proposed and proved. In no deadline constrained condition, the problem belongs to polynomial time algorithm. It is proved by using 3 partition that if the problem is deadline constrained, its complexity is strong NP hard. Finally, a conjuncture is proposed that is to be proved.

ing Problems with Variable Processing TimeTX@周贤伟@杜文@朱健梅IntroductionThesinglemachineschedulingproblemwithvariableprocesingtimecanb...

This paper considers the following scheduling problem (P): n jobs demand to be processed on the same machine and there exists a common due window for each job.If a job finishes its processing ahead of the common due window,it will be a weighted early job,and if a job finishes its processing after the common due window,then it will be a weighted tardy job.The task is to schedule the n jobs and determinate a location of the common due window such that the weighted number of early and tardy jobs is minimized.This...

This paper considers the following scheduling problem (P): n jobs demand to be processed on the same machine and there exists a common due window for each job.If a job finishes its processing ahead of the common due window,it will be a weighted early job,and if a job finishes its processing after the common due window,then it will be a weighted tardy job.The task is to schedule the n jobs and determinate a location of the common due window such that the weighted number of early and tardy jobs is minimized.This paper proves the NP\|hardiness of the problem,and gives a pseudopolynomial branch algorithm.That is to say it is a ordinary NP\|hard problem and not a strong NP\|hard one.

此文考虑下述排序问题 (P) :有 n个工件需在同一台机器上加工 ,对各工件有一共同的宽容交货期 .若一工件在此宽容期前完工则为一超前工件 ,若在此宽容期后完工则为一延误工件 ,要求适当安排一加工方式和宽容交货期的位置使加权超前延误工件数最小 .文中证得 (P)是 NP-hard的 ,并给出一伪多项式时间的分枝状精确算法 ,这也就可以认为它是一般意义下的 NP-hard问题而不是强NP-hard问题 .

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

 


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

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