历史查询   



 为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法，我们为您准备了出自英文原文的大量英语例句，供您参考。 
As a consequence, we show strong NPhardness of a number of similar problems, including a severely restricted version of the Numerical 3Dimensional Matching problem.


In this paper, we first present a strong NPhardness result of the problem.


The P2 epitope was demonstrated in 13, the NP1 epitope in 12, the P3 epitope in 9, and the P1 epitope in 3 brains, but staining was severely reduced compared with the NP2 epitope and restricted to areas with strong NP2 expression.


Mice primed and boosted once with a plasmid encoding the fulllength NP gene, pCMV/NP, but not with the minigene pCMV/NPep, developed a strong NP(147155)specific CTL response within 2 weeks after the boost.


In this paper, we give proofs for the strong NPhardness 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.  文中将多媒体时间同步问题转化为一个有向带权图的平衡权值分配问题．针对这样一个强ＮＰ类难解问题，提出了节点删除法和图分解法来处理原始图，尽可能地降低计算复杂性，从而有效地解决多媒体时间同步问题．  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.  ｉｎｇ Ｐｒｏｂｌｅｍｓ ｗｉｔｈ Ｖａｒｉａｂｌｅ Ｐｒｏｃｅｓｓｉｎｇ ＴｉｍｅTX＠周贤伟＠杜文＠朱健梅ＩｎｔｒｏｄｕｃｔｉｏｎＴｈｅｓｉｎｇｌｅｍａｃｈｉｎｅｓｃｈｅｄｕｌｉｎｇｐｒｏｂｌｅｍｗｉｔｈｖａｒｉａｂｌｅｐｒｏｃｅｓｉｎｇｔｉｍｅｃａｎｂ...  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)是 NPhard的 ,并给出一伪多项式时间的分枝状精确算法 ,这也就可以认为它是一般意义下的 NPhard问题而不是强NPhard问题 .   << 更多相关文摘 
相关查询  



