并行算法

And the characteristic of parallel computing saves running time and improves the calculating efficiency.

同时遗传算法的并行运算特性节省了运算时间，提高了运算效率。

This method uses quantified conjunctive normal form formulas to represent the unknown constraints in the circuit under verification, and needs no modification of the circuit structure so that it saves the computational resources significantly.

该方法使用量化的合取范式来表示电路中出现的未知约束，并且不需要修改电路结构，有效地节省了计算资源。此外，通过使用随机并行模拟增强了可满足性算法的错误检测能力。

The paper uses it to construct optimal algorithms for two dimensional cutting stock problem and parallel-machine problem.

文中采用该模型构造了求解板材套料优化和并行多机调度问题的优化算法。

The essential of this method is the model and algorithm of a parallel fast decoupled load flow with coarse-grain spaces based on the decomposition and coordination principle of large-scale networks.

该方法的核心是基于大规模电网分解协调原理的粗粒度空间并行快速解耦潮流模型和算法。

To the question, we consider introducing usual WR algorithm to decouple and parallize the system.

对于此问题，我们考虑引入普通的波形松弛算法来对系统进行解耦并实现并行。

An approach based on Bin-Packing algorithm and graph theory is proposed to avoid the hot-spot and distribute heat evenly on chip surface during test scheduling. First several parallel test set are derived from graph models. Then Bin-Packing algorithm constructs an initial test schedule.

在SoC的测试规划时，考虑为避免在测试过程中出现热点以及测试过程中使热量均匀分布，基于建立的问题模型得到一系列的并行测试集合，再通过Bin-Packing算法构造测试规划，并进行全局的优化。

In this paper, a new algorithm is proposed to compute the decomposition of these matrices so the split of the matrices becomes more direct and the initial decomposition can be achieved more quickly.

论文针对带状对称的Toeplitz矩阵，在已有算法的基础上提出一种新的分解方法，从而使矩阵化解和初始本征分解更为简洁迅速，并具有较高的并行度。

Directed HD distance is taken as the similarity measuring of template matching and effectively it can reduce the matching calculation amount; the immune genetic algorithm has powerful robust and parallel searching.

部分HD距离作为模板匹配的相似性测度，可有效减少匹配计算量；免疫遗传算法具有较强的鲁棒性和强大的并行搜索能力。

In this dissertation we propose a set of fast algorithms for computing the DGFT (Discrete Generalized Fourier Transforms) over the hexagon domains and the parallel dodecahedron domains and give the parallel implementation on Linux clusters.

本文在理论上的主要贡献就是利用多色排序、区域分解和多重网格的思想，设计了二维三方向平行六边形区域和三维四方向平行十二面体区域上广义离散傅立叶变换的快速算法并给出它在PC Linux机群上的并行实现。

In order to solve non-identical parallel machine earliness/tardiness scheduling problem with different due windows,a hybrid genetic algorithm based on sectional coding is suggested.

为有效地解决不同交货期窗口下的非等同并行多机提前/拖后调度问题，设计了一种分段编码的混合遗传算法。

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.

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