算法

This feature leads to overlong and sparse bit vectors of BV algorithm, which requires a large amount of storage resources and too many read cycles in network processor.

在大型网络中大量的规则数量会导致位向量算法的位向量过长和稀疏，要在网络处理器中实现BV算法需要大量的存储资源，而且多次存储读取也降低了算法匹配效率。

In this paper, a new kind of two-dimensional Cellular Automata is studied. Several algorithmic rules are discovered that can be used to design new Cellular Neural Networks which can implement shadow detector and overstriking for character recognition. Their Boolean expressions and learning algorithms are introduced detailedly.

摘要该文深入研究了一种新的二维细胞自动机，找到了几种新的算法规则可以用来实现字符的粗化处理和阴影检测，并且用这些规则设计了几种新的细胞神经网络，文中详细介绍了这些算法规则的布尔代数表达式和细胞神经网络学习算法。

Into the algorithm, first-out (2) at least recently used algorithm (3) the best out of algorithm In this experiment, the page address stream length of 320, the page number for each failure to visit the corresponding instructions, the instructions corresponding to the number of pages is not memory.

进先出的算法（2）最近最少使用的算法（3）最佳淘汰算法在本实验中，页地址流长度为320，页面失效次数为每次访问相应指令时，该指令所对应的页不在内存的次数。

In order to carefully analyze the validity of the Paleogene hydrocarbon source rocks, this article proposes two new algorithms, that is, the partial average algorithm and the average correlation algorithm.

为了更细致分析古近系烃源岩的有效性，作者提出两种新的算法，即应用局部平均算法和平均相关算法，可以通过数量大小判断出某一段内烃源岩的有效程度。

Combined genetic algorithms with domain decomposition parallel FEM, designed parallel FEM evolutionary displacement back analysis algorithm, developed corresponding program- GAParal-lelFEM3D(version 1.0)using C++.

把遗传算法和区域分解并行有限元算法结合，设计了进化并行有限元位移反分析算法，采用Visual C++开发了进化并行有限元位移反分析计算软件GAParallelFEM3D(v1.0)。

An approach is given to pick out the optimal solution from the set of solutions of the parametric optimization problems.

这种算法为三级算法。本文证明了算法的收敛性并建立了其理论基础，仿真效果好。

In Chapter 4,The convergence of two forms of genetic algorithms base donthe feature of the non-formal selection strategies is proved including themodel of genetic algorithms under the population fitness constraints and somehigher fitness individuals in parent population participating in the comp-etition.

第四章以非形式化选择为特点，给出遗传算法的种群适应值约束下算法模型与父代种群前若干适应值高的个体参与竞争下遗传算法的收敛性。

Using dynamic programming algorithm can be elegant and efficient solution for many greedy algorithm or partition algorithm to solve the problem.

利用动态规划算法，可以优雅而高效地解决很多贪婪算法或分治算法不能解决的问题。

Based on the research on the min-cut partition problem, the author presents an improved KLFM partition algorithm and a graph partition algorithm based on simulated annealing.

在此基础上，本文对最小割划分算法进行深入研究，提出了改进的KLFM划分算法和基于模拟退火的逻辑图划分算法。

The other often used algorithm of association rules is Frequent Paten Growth which do not produce candidate itemsets and improve the efficiency a lot.Algorithms of association rules are based on transaction database.

关联规则发现的另外一个常用的算法频繁模式增长算法是一种不产生候选集挖掘频繁项集的算法，在执行效率上有了很大的提高。

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.

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