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

图标索引 历史查询
 

nphard
相关语句
  np-hard
     It is an important complex combination optimization problem and has been proved to be NP-hard.
     已知CPMP是一类NP—hard组合优化问题,因此已有多种启发式算法用于求解该类问题。
短句来源
     3.Since adjusting the stage plan is a large scale of combinatorial optimization problem, is one kind of NP-hard problems.
     3.鉴于列车运行调整计划的优化问题是一类大规模组合优化问题,属于NP—Hard问题。
短句来源
     Compare with the method employed in Routing Arbiter the new algorithm is no np-hard problem at all.
     与著名的Arbiter路由仲裁计划提出的路由振荡检测算法比较,文中提出的算法不是np—hard问题。
     Zero. one quadratic programming problem is known to be an NP-hard problemwith numerous applications.
     0—1二次规划问题是一个已知的NP—hard问题,具有广泛的应用。
短句来源
     After introducing the basic structure of UMTS and UTRAN and its related theories, the mathematical model of cost function of UTRAN was defined. And it is taken for granted that this problem is a NP-hard problem.
     本文在介绍了UMTS和UTRAN的基本结构及所涉及的理论之后,定义了3G无线接入网的费用函数的数学模型,并认定为带约束条件的NP—hard问题。
短句来源
更多       
  “np—hard”译为未确定词的双语例句
     At first the problem of the matching search of domain and range in the Jacquin algorithm of fractal image coding has been analyzed and the result of it belonging to the NP_HARD has been found. Then modern optimization theory has been applied into the matching search of domain and range in fractal image coding.
     首先经过分析发现简库恩算法中的定义域、值域匹配搜索问题属于组合优化问题中的NP—HARD,并把组合优化方法应用于分形图像压缩编码的搜索过程。
短句来源
     Besides, Laplace eigenvalues can estimate a good many invariables of graphs, such as connectivity, diameter, bandwidth, so Laplace matrix is very important to the research of graph theory.
     对Laplace谱的研究的另一个方向是用其特征值来估计图的不变量,如连通度、直径、带宽、等周数等,鉴于有些图不变量的计算是NP—hard的。
短句来源
     At the same time, the new intelligent calculation method which is used to resolve complicated optimization problems by simulating natural ecological mechanism, such as genetic algorithm, ant colony algorithm and immunity algorithm, is well self-adaptive.
     尤其是从意大利学者Dorigo,Maniezzo & Colorni(1991)提出的蚂蚁算法(ant algorithm)开始,具有NP—hard性的组合优化的调度问题成为蚁群算法的一个重要研究方向。
短句来源
     Tests and simulations show this method can solve multi-restrictions Job Schedule fitness functions problems,also can show schedule dynamical Gantt pictures thus improving the programs using scope and application values.
     最后利用V isual C++良好的人机交互功能,用V isual C++编写算法的输入输出接口界面。 实验和仿真表明,该方法有效解决了多约束条件下,高时间、空间复杂度车间调度系统(NP—Hard组合问题)适应度函数求解的难题,并得到调度方案的动态甘特图,从而提高了程序的适用范围和应用价值。
短句来源
  相似匹配句对
     ,…,Np(.)
     ,…,Np(.)
短句来源
     It's a NP-hard problem.
     该问题属于NP-hard问题。
短句来源
     Packing problems are categorized as NP-hard problems.
     布局问题是NP-hard问题。
短句来源
     A Study of Chinese Sentence Pattern ‘yi + v. shi NP’
     “一V是NP”句式
短句来源
     Zero. one quadratic programming problem is known to be an NP-hard problemwith numerous applications.
     01二次规划问题是一个已知的NPhard问题,具有广泛的应用。
短句来源
查询“np—hard”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  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.
      
更多          


In this paper,we consider the scheduling and wavelength assignment(SWA) problem which arises in optical wavelengthdivisionmultiplexing(WDM) networks.We only study the nonpreemptive case.If the number of wavelengths (processors) is a fixed constant,we prove that the SWA problem is NPhard and present a polynomial time approximation scheme (PTAS) to solve it.If the number of processors isn't fixed,we prove that there does not exist an approximation scheme for the problem.

本文考虑基于波分复用技术 (WDM)的光学网络中的排序与波长分配问题 .在波长数目固定的情况下 ,我们证明此问题是NP 困难问题 ,并且给出一个多项式时间近似方案 .若波长数目不固定 ,我们证明此问题不存在多项式时间近似方案

A competitive location model of logistics distribution center is introduced on the basis of analyzing its characteristic. For this model is a combinatorial optimization problem of NPhard,the local optimal solutions to this competitive location model of logistics distribution center are often gotten by the common algorithms. To solve the problem,this paper puts forward a kind of hybrid genetic algorithm combining Drezner algorithm with genetic algorithm. The optimization performance of hybrid genetic algorithm...

A competitive location model of logistics distribution center is introduced on the basis of analyzing its characteristic. For this model is a combinatorial optimization problem of NPhard,the local optimal solutions to this competitive location model of logistics distribution center are often gotten by the common algorithms. To solve the problem,this paper puts forward a kind of hybrid genetic algorithm combining Drezner algorithm with genetic algorithm. The optimization performance of hybrid genetic algorithm is improved by using the local search ability of Drezner algorithm and the global search ability of genetic algorithm. The research result demonstrates that hybrid genetic algorithm can solve the problem of competitive location of logistics distribution center very well.

在分析有竞争的物流配送中心选址特点的基础上,引入了一种有竞争的物流配送中心选址模型。由于该模型是一个组合优化问题,具有NP难的性质,用常规算法对其进行求解时,经常会陷入局部优化解。针对这一情况,提出一种求解该模型的混合遗传算法,该算法主要利用Drezner算法的局部搜索性能来提高遗传算法的寻优能力。研究结果表明该算法能很好地处理有竞争的物流配送中心选址问题。

Multidimension package problem is a classic NPhard problem.In order to solve the package problem effectively,this paper presents the ideas of three mixed new genetic algorithms,such as QGA and VEGA,and QGA lays stress on the implementation of algorithm parallelism and VEGA implements the combination of local search and whole search by using biology mechanism of virus infection and cooperation evolution between virus unit and host unit.The problems that need to be improved are presented.

多维背包问题是经典的NP hard问题。为了更有效地解决背包问题,针对多维背包问题介绍了三种比较新的混合遗传算法的思想,尤其是QGA和VEGA,QGA较注重于算法的并行性实现,VEGA则是利用病毒感染的生物机理,利用病毒个体和主个体之间的协同进化而实现局部搜索和全局搜索的结合。提出了值得改进的问题。

 
图标索引 相关查询

 


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

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