查询词典 NP

The determination method of 237 Np in the large amount of uranium by γ spectrum is developed.

研究建立了γ谱法直接测定大量铀溶液中2 3 7Np的方法。

Packing problem is NP complete,this paper uses an immune genetic algorithm to solve it.

本文用一种免疫遗传算法来研究装箱问题的求解。

Does P equal NP? is one of the most important unsolved questions in modern mathematics.

是近代数学中一个重要的待解问题之一。

Objective To compare two methods to determine the strychnine in Nux vomica b.

目的 比较NP-HPLC 与 RP-HPLC 两种测定制马钱子中士的宁含量的方法。

In this study, we argue that the obligatoriness of le is not due to the necessary realization of T within the verbless clauses and the parametric variation. We, adopting Shen's (2004) and Lin's (2006) frameworks, postulate that le in verbless clauses is actually more like an aspect, denoting "change of slate", and we argue that it is the "perfect" meaning implying "change of stale" that licenses the Chinese verbless constructions.

我们因而提出「NP-了」句式中「了」的出现并非因为时式实现之公要性来允准「无动式副词子句」，反之我们依据Shen (2004)和Lin(2006)的理论视句末「了」为表示「状态变化」的完成体，此「无动式副词子句」事实上是由「状态变化」的语意来允准，这也解释了为何同属於完成体的「过」也可存在於此种「无动式别词子句」。

The approach of simplized the carflow adjustment problem support by the artificial intelligent is deliberated which could solve the heavy workload of construct model and solve the optimal problem of the routine carflow adjustment problem as a network optimalization problem.

针对日常车流调整作为网络优化问题在建模和计算的NP性质，提出人工智能支持下的对车流调整问题进行简化的思路。

The basis of this method,a program control structure generation algorithm and an automated testing tool for optimizing compiler which is implemented based on the algorithm are introduced.

编译优化的工作进一步增大了编译系统的复杂性，优化问题大多是NP问题，一些优化方法还与机器的体系结构密切相关。

Heuristic algorithms are needed to solve the NP-complete problems, which is the method of this paper to study the packing problems. On the basis of lots of tests and the wide research on the packing problems, a heuristic algorithm based on objective and orthogonal decomposition of space is developed to solve the non-guillotine packing problem.

沿着这一优化问题解决的路经，在研究分析现有布局启发式算法的基础上，通过大量布局实验并不断地总结，提出了基于目标和空间正交分解的布局启发式算法，解决布局过程中的非一刀切布局问题。

The characteristic of this computation is its powerful ability in parallelism,its huge storage and high energy efficiency.

只能通过不确定的算法在多项式时间内解决的问题称NP类。

Oxygen can passivate the boundary of each Co NP.

氧气可钝化Co NPs的表层。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。