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

图标索引 历史查询
 

np-完全
相关语句
  np-complete
    It lies at the every heart of a family of NP- complete problems, and is important to both computer science and practical applications.
    可满足性问题是第一个NP-完全问题,并且是一大类NP-完全问题的核心。 大量的实践表明,许多NP-完全问题无论对于计算机科学理论还是工程应用都有着至关重要得意义。
短句来源
    The problem of multipoint network topological design is NP-complete.
    多点网络拓扑结构设计问题是NP-完全问题。
短句来源
    In multimedia network the routing problem is subject to QoS constraints. These problems are NP-complete.
    高速多媒体网络中的路由问题是有QoS约束的路由问题,满足一个或多个约束的组播路由问题是NP-完全问题。
短句来源
    In combinatorial optimization the VRP is a NP-Complete problem provided with many constraints and it is very hard to be solved by traditional methods. So many researchers have been paying much attention to the meta-heuristics algorithm, such as genetic algorithm, simulated annealing, tabu search, ant colony optimization.
    车辆路径问题是组合优化中的带多个约束条件的NP-完全问题,难以用常规方法求解,人们常致力于智能优化算法的研究,如遗传算法,禁忌搜索,蚁群最优化等。
短句来源
    The TCNN is extended for solving $K$-colorability problem which is one of NP-complete problems.
    另外我们还用此法求解了属于 NP-完全问题的 K色图着色问题
短句来源
更多       
  np-completeness
    It is one of the considerably complicated scheduling problems due to its NP-completeness.
    由于其本身具有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.
      
更多          
  np-completeness
We prove the NP-completeness of the solvability problem in a free semigroup for equations of the formw(x1,...,xn)=g, wherew(x1,...,xn) is a semigroup word in the alphabet of unknowns andg is an element of a free semigroup.
      
A joint signature, entyption and error correction public-key cryptosystem is presented based on an NP-completeness problem-the decoding problem of general linear codes in algebraic coding theory.
      
The property of NP-completeness of topologic spatial reasoning problem has been proved.
      
The proof for the property of NP-completeness in directional spatial reasoning problem is based on two important transformations.
      
The NP-completeness of state safety (is there a sequence of state transitions leading to the empty state?) implies that a correct and scalable SCP will reject some safe states.
      
更多          


The general task scheduling problem is NP hard and usually we adopt a heuristic algorithm of polynomial time compexity. In this paper we present an optimal-scheduling problem and then propose an effective distr-ibuuted algorithm to solve it. Finaly, based on simulation and analysis, we give an informal discussion of the algorithm's behavior.

一般形式下的进程调度问题是NP完全的,一般采用多项式时间复杂性的启发式算法求其次优解。我们提出一种调度问题。其求最优解的复杂性也是NP完全的。我们先将问题化成图论问题。然后提出一种有效的分布式算法求其次优解。最后,基于分析和模拟,我们对该算法的行为进行了讨论。

Finding coverage with minimum cost is an important step in logic minimization. Since it is a Np-complete problem, it is not practical for large input data. In this article, we use a stochastic neural network to find the optimal coverage through formalizing the coverage problem; choosing appropriate annealing schedule and parameters. The algorithm we use has low time and space complexity, and has high parallelism.

寻找最小代价覆盖是逻辑最小化中的一个重要步骤.由于这是一个NP完全问题,对较大量数据寻找最佳覆盖不实际.本文利用一个随机并行算法,通过将覆盖问题公式化来寻找一个代价函数的全局极值.选择适当的退火策略与参数值即可以得到最佳覆盖结果.所用算法具有较低的时间和空间复杂性,并有高度的并行性.

This paper presents a representation language based on Rough Set theory,called RSL. This language has two parts: one is for application and the other for theory research. The application part is designed mainly for information analysis, such as data analyses and decision making. The research part tries to provide a tool for researchers on theory or on constructing more complicate algorithms. Finding the smallest reduction has been proved to be an NP-complete problem, a domain-independent approximate algorithm...

This paper presents a representation language based on Rough Set theory,called RSL. This language has two parts: one is for application and the other for theory research. The application part is designed mainly for information analysis, such as data analyses and decision making. The research part tries to provide a tool for researchers on theory or on constructing more complicate algorithms. Finding the smallest reduction has been proved to be an NP-complete problem, a domain-independent approximate algorithm is presented in this paper. It makes the RSL more suitable to deal with large information tables.

本文绘出了一种基于RoughSet理论的表示语言—RSL,该语言包括面向应用与面向研究两部分.应用部分主要服务于对信息表进行分析与处理的用户,研究部分则主要是为研究RoughSet及利用RoughSet理论构造更复杂算法的研究者所设计.鉴于RoughSet理论中求最小约简的过程是NP完全问题,为了使RSL表示语言可以分析与处理规模更大的信息表,本文还为RSL表示语言设计了一个新的对求取最小约简而言的领域独立的近似算法.

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

 


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

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