您要查找的是不是:
- Knapsack problem is a typical NP complete problem. 背包问题是一个典型的np完全问题。
- This is analogous to the NP Complete problem. 这与NP完全问题是类似的。
- Biomolecular computing has been successfully applied in computing NP complete problems such as Hamiltonion path problem, maximal clique problem and SAT problems in Boolean calculation, etc. 生物分子计算已成功地应用于计算哈密顿路径、最大集合以及逻辑运算中的SAT类问题等 NP完全问题。
- A approximate algorithm is presented by which satisfactory results of two dimensional optimal layout belonged to NP complete problems can be obtained efficiently and rapidly. 摘要针对理论上属于NP完全问题的二维矩形件优化排样问题,构建了一个排样效率高、计算速度快和排样效果好的一种近似算法。
- An NP completeness problem. "Does P equal NP?" is one of the most important unsolved questions in modern mathematics. (Image courtesy of MIT OCW. NP问题.;“P等于NP吗?”是近代数学中一个重要的待解问题之一。(图片由麻省理工开放式课程提供
- It cause the parser to parse an np. 它调用分析程序分析一个名词短语。
- The DAG scheduling problem has shown to be NP complete in general. 一般情况下,这种DAG调度是个NP完全问题。
- It causes the parser to parse an NP. 它调用分析程序分析一个名词短语。
- It cerse the parser to parse an np. 它调用分析程序分析一个名词短语。
- NP complete problem NP完全问题
- Traveling salesman problem (TSP) is a typical NP complete combinatorial optimum problem. 摘要旅行商问题(TSP)是典型的NP完全组合优化问题。
- This paper formulates the satellite imaging scheduling problem as a 0-1 integer programming model,which is NP complete. 建立了卫星成像调度问题的0-1整数规划模型,该问题具有NP完全特性。
- Both in GB and MP, NP-movement is a local one and an NP must be moved successive-cyclically. 在“管约论”和“最简方案”的框架下,名词短语移位都必须在某个局部范围内进行,并且要循序渐进。
- SU construction is a special kind of an NP structure in Chinese. The typical pattern is 所(SUO)+VP+NP. 所字结构是中文中的一种特殊结构。典型结构是所(SUO)+VP+NP.
- Based on the NP complete theory, and setting off from the problem's computability and complexity, the principle and realizing process of the greed algorithm are proposed in this paper. 在NP完全理论的基础上,从问题的可计算性与复杂性出发,提出贪心算法的实现原理与实现过程。
- UTP is an NP problem, It is required to satisfy the requirements of the five elements of the soft and hard constraints in a certain time and space. 摘要UTP问题是一个NP问题,要求在一定时间空间内满足五要素的软、硬约束条件。
- To the best of our current knowledge, there are no exact solutions to problems that are NP Complete. 按照目前的知识,NP完全问题没有精确解。
- Fulfill complete problem investigation for all major pollution sources, dangerous chemicals, and environmental hazard. 立即开展各类重点污染源及危险化学品环境污染隐患的全面排查工作。
- Even in the LR framework, the hydro subproblem with cascaded reservoirs and discrete hydro constraints is still NP complete and therefore is difficult to solve mathematically. 文中提出了将这种方法应用于电力系统优化调度问题(具有离散区间的混合整数规划问题)的方法。
- Sheet metal part cutting stock problem is a kind of Nondeterministic Polynomial Complete problem that cannot be solved exactly by algorithms. 钣金件优化排样问题是在理论上具有最高复杂性的NP完全问题,没有准确的求解算法。