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

图标索引 历史查询
 

np-完全
相关语句
  np-complete
    Multiple constrained QoS routing problem is a NP-complete problem. Currently, we search hypo-excellent paths using heuristic algorithm to solve this problem.
    多约束条件下的QoS路由问题是一个NP-完全问题,一般采用启发式算法寻找其次优解。
短句来源
    In multimedia network the routing problem is subject to QoS constrains. These problems are NP-complete.
    高速多媒体网络中的路由问题是有QoS约束的路由问题,多受限的路由问题是一个NP-完全问题。
短句来源
    Delay-constrained multicast routing has been proven to be a NP-Complete problem.
    具有时延约束的组播路由问题已被证明是NP-完全问题。
短句来源
    The problem has been considered as a NP-Complete problem.
    这个问题通常被认为是一个NP-完全问题.
短句来源
    Security query is classified by necessity and possibility. As a result, necessary security query and possible security query independent of status can be resolved in polynomial time, and the conditions under which possible security query is NP-complete problem are presented, but general possible security query is un-decidable.
    将安全查询分类为必然性安全查询和可能性安全查询,证明了必然性安全查询和与状态无关的可能性安全查询能在多项式时间内被有效解决,给出了满足NP-完全问题的可能性安全查询的条件,而一般的可能性安全查询是不可判定的.
短句来源
更多       
查询“np-完全”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  np-complete
This paper proves that the (2,2) path chromatic number problem of graphs with maximum degree 4 is NP-complete.
      
In general, this problem is NP-complete and it is proved that forn=2 and 3 this problem is polynomial-time solvable.
      
MKP (B,S,m,n) is strongly NP-Complete and no polynomial-time approximation algorithm can have an approximation ratio better than 0.5.
      
Many difficult (often NP-complete) optimization problems can be solved efficiently on graphs of small tree-width with a given tree-decomposition.
      
In the authors' previous work, it has been proved that the problem is NP-complete and there does not exist any constant factor approximation algorithm for it unless P = NP.
      
更多          


A neural network approach is presented for the concentrator location problem (CLP) in network design.The goal of this NP complete problem is to minimize the total cost with capacitated concentrators.In this paper,the problem is efficiently solved by the special neural network.To construct the dynamic systems using the penalty function method and the augmented Lagrangian multiplier method of differential equations is efficient and feasibe in finding optimal or approximately optimal solutions.

本文给出了用于解决网络设计中集中器定位问题的神经网络方法。这类容量受限的集中器定位问题是求最小总花费的NP完全问题,采用专门的神经网络可以有效解决。利用扩张拉格郎日乘数法和惩罚函数构造神经网络动态系统的微分方程是有效可行的,并能求出最优解或近似最优解。

The DCLC routing problem in QoS routing is NP-complete. In this paper, We present a heuristic solution which is polynomial complexity, called the dela y-constrained least-cost routing based on selective function (DCLC-SF) algori thm. The DCLC-SF is source routing algorithm, based on simple selective functio n. The computation complexity of DCLC-SF is O(3ne).Simalation results prove tha t DCLC-SF is effective and accurate.

Qo S路由的 DCL C(Delay- Constrained L east- Cost Routing)路由问题是一个 NP—完全问题 .本文提出了一种多项式复杂度的启发式算法 DCL C- SF(Delay- Constrained L east- Cost Routing Based on Selective Function) ,DCL C- SF算法基于简单的选择函数 ,属于源路由算法 ,算法最坏情况的计算复杂度为 O(3ne) .仿真实验证明 DCL C- SF算法是一种精确的启发式算法

With the frequent information accesses from users to the Internet, it is important to organize and allocate the information resources properly on different Web severs. This paper considers the following problem: Due to the capacity limitation of each single Web server, it is impossible to put all information resources on one Web server. Hence it is an important problem to put them on several different servers such that (1) the amount of information resources assigned on any server is not larger than its...

With the frequent information accesses from users to the Internet, it is important to organize and allocate the information resources properly on different Web severs. This paper considers the following problem: Due to the capacity limitation of each single Web server, it is impossible to put all information resources on one Web server. Hence it is an important problem to put them on several different servers such that (1) the amount of information resources assigned on any server is not larger than its capacity; (2) the access bottleneck can be avoided. This new open problem was proposed in \ where the simplified version was studied. In order to solve the problem, this paper first introduces an objective function and thus models it as an integer linear programming problem. Then the author analyzes its NP hardness in several cases. A pseudo polynomial time optimal algorithm is presented. Based on the computational complexity results, the paper further focuses on the design of heuristic. To get near optimal solution, the paper presents an approximation algorithm Greedy which runs in O(n log n ) time and has a worst case ratio of 1/2. Moreover, the paper proves that there does not exist a polynomial time approximation algorithm with a worst case ratio better than 7/9. The paper closes with some numerical experiments and conclusions.

讨论了互联网通信中的一个信息选取与规划问题 .由于内部网的单个 Web服务器容量不够大 ,不能容纳与日剧增的信息内容 ,如何将众多的信息分布到多个 Web服务器上 ,使得每个服务器上存放的信息总量不超过各个服务器容量且避免访问瓶颈的发生 .这是陈卫东等 1999年提出的一个新问题 ,该文建立了该问题的一个优化新模型 ,在讨论了它的强 NP-完全性、难近似性后 ,给出了一个伪多项式时间最优算法和一个多项式时间近似算法

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

 


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

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