助手标题
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
共[1]页 共[17]条 当前为第1条到17条
 

相关语句
nphard
Although this problem is NPHard, one may obtain a solution that is within a proven bound of the optimal.
      
Complexity theory indicates that most resource-constrained project scheduling problems are NPhard.
      
Estimating Treewidth Finding the treewidth of an arbitrary graph is known to be NPhard.
      
However, we believe that finding the optimal set is NPhard.
      
Hence, the correspondence to combinatorial auctions suggests that the problem of finding an allocation with maximal social welfare is at least NPhard.
      
Implied by this observation is that identifying superfluous clauses is an NPhard problem.
      
Learning a graphical model is an NPhard problem and in this paper, various heuristics have been proposed to speed up the learning process.
      
Moreover, nested inside each of our problems are NPhard second stage decision problems.
      
Moreover, we do not know whether the transceiver minimization problem is NPhard.
      
NPhard optimization problems can be solved consistently within a reasonable amount of time only if instance size is sufficiently small.
      
Recall that finding an integral solution with minimum potential is NPhard.
      
Surprisingly, finding a most-preferred model in even this very limited system is shown to be NPhard.
      
The CVP problem is a difficult problem, NPhard even when allowing quite large approximation factors.
      
The first is NP-complete and the second is conjectured NPhard.
      
Unfortunately, as with the classical location problem, the problem is NPhard.
      
We show that constructing an optimal rectangular layout is NPhard.
      
We have proven that false alarms can be corrected in polynomial time, but the correction of missing alarms is NPhard.
      
 

首页上一页1下一页尾页 

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