查询词典 NP

Now HLS has absorbed much research attention in IC-CAD field. In HLS, algorithms represented by algorithm description language are transformed into hardware structure description consisted of resisters and transfers. In the transforming process, synthesis of datapath is a core. The other works is based on it. And in the synthesis of datapath, operation scheduling, functional unit allocation and binding all are NP-Completeness problems. The structure of their solution space is not known well. If we must find a global optimum solution, we can only use exhaustion. This way needs too much computation for VLSI synthesis, and is impractical in Industry. So usually heuristic algorithms are used to search suboptimum solution.

因此HLS成为国际IC-CAD学界的一个热门，它把算法描述语言表达的算法转换为用寄存器、传输器描述的硬件结构，其中以数据通路的综合为主体，其余工作皆以此为基础；而在数据通路综合中，操作调度、功能单元分配、连线等均属NP问题，目前该问题的解空间尚未充分了解，如要求得最优解，只有采取穷举搜索法，对于大规模集成电路而言运算量太大，工业中无法承受，故通常都采用启发算法求次优解。

Because of the NP-hard nature of the solution space, a genetic algorithm using symbolic coding is proposed.

鉴于该问题属于NP—hard问题，采用符号编码方式的遗传算法，合理体现了问题的特点并使得问题规模得到有效控制。

This is mainly because time-table problem belongs to NP-complete category. So this paper will focus on the exploration and study courses scheduling algorithm, especially on the research of classification algorithm.

这主要是由于排课表问题属于NP完全类问题，因此本文将注意力集中于课表编排实用算法的探索与研究，重点研究课程前驱后继算法。

From the experiment of fertilizer which is one technology of cultivation, forage triticale is very sensitive to NP and Org.

研究对与小黑麦栽培调控关系最为密切的N、P、K 施肥反应做了研究，看出饲料小黑麦由于长势强生物量大，因而对NP 配合施用反映十分敏感，同样对优质有机肥反映亦很敏感。

Topics covered include: finite automata and regular languages, context-free languages, Turing machines, partial recursive functions, Church's Thesis, undecidability, reducibility and completeness, time complexity and NP-completeness, probabilistic computation, and interactive proof systems.

课程项目包含：有限状态机与正规语言，情境无关语言，Turing机，部分递回函数，Church理论，不可判定性，可简化性与完整性，时间复杂度与NP-完整性，或然率计算，与交互验证系统。译注：Turing machine 一般译作"图灵机"或"图林机"，本课程依据专有名词保留原则，一律译为Turing机。

Maximum Clique problem is a classic NP hard combinatorial optimization problem, a lot of practical problems can be abstracted as undirected graph of the largest corporations to solve the problem, therefore, the largest corporation on the issue of research both in theory and in fact have a major significance.

最大团问题是一个经典的NP难的组合优化问题，很多实际问题都可以抽象为对无向图上最大团问题的求解，所以，对最大团问题的研究无论在理论上还是实际上都有重要意义。

Considering the equation of flow conservation, the problem of efficient monitoring is regarded as the problem of finding out the minimum weak vertex cover set and the minimum weak vertex cover set based on flow partition for a given graph G which are all proved NP-Complete.

考虑网络节点的流守恒特性，网络流量的有效监测问题可抽象为求给定图G的最小弱顶点覆盖集的问题和基于流划分的最小弱顶点覆盖集的问题，这是NP难的问题。

The problem of seeking monitor-nodes for measuring the network traffic is regarded as the problem of finding out the minimum weak vertex cover of a graph which is NP-hard.

摘要网络流量监测点问题可以抽象为图的最小弱顶点覆盖问题，而求解最小弱顶点覆盖问题是一个NP难题。

Quadratic assignment problem is a NP-hard combinatorial optimization problem and has been applied in various fields. There are always many zero elements in the flow matrix or distance matrix of the quadratic assignment problem instances which are abstracted from the practical problems. Much computation time can be saved if we can first reduce the size of the problem by using its zero elements.

二次分配问题(quadratic assignment problem， QAP)是应用于诸多领域的组合优化NP-难题，许多从实际问题中抽象出来的二次分配问题，其流矩阵与距离矩阵中存在大量零元素，如果在该类二次分配问题的求解中，能够充分利用这些零元素的信息，将大大缩减问题的规模，节省大量运算时间。

Traveling Salesman Problem is a classic NP problem, which is the main standard of measuring the efficiency of approximative algorithms. So the solution of the problem has has very important significance.

Traveling Salesman Problem问题是一个典型NP难题，是衡量近似算法效率的主要标准，因此设计TSP问题的近似算法具有非常重要的意义。

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.

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