算法的

The effectiveness of the improved approach is demonstrated based on its application to knapsack problem.

并利用组合优化中典型的背包问题对算法进行了验证，并和基本遗传算法的结果进行了比较，验证了算法的有效性

LPP has incorporated the advantages of both linear and nonlinear dimension reduction algorithms.

LPP算法是基于LE算法的线性扩展，兼具有非线性的LE算法和线性降维方法二者的优点。

As to the multiple classification algorithms of large size rule set, we introduce a algorithms named recursive flow classification and this algorithms use the linear buffer to implement recursive map.

接着本文介绍了应用于大规模规则库的快速分类算法的解决方案——递归流分类，该算法是一种利用线性存储区分块递归映射的算法。

This algorithm which computes the inversion of operator matrix is simple and fast based on the special structure of operator matrix.

该算法利用了算子矩阵的特殊结构，采用简单、快速的矩阵求逆算法，使算法的运算量和数据存储容量大幅度下降。

The optimal design of layout programming of RRMS is explored. The mathematical programming model based on matroid is established and the greedy method is selected serving as the optimal method. The application program based on this method is also developed and compiled.

摘 要：研究探索了快速可重组制造系统布局规划中的优化设计问题，建立了基于拟阵的数学规划模型，通过对比选取贪馋算法作为优化算法，并编制开发了此算法的应用程序。

However, for hill-climbing strategies to be guaranteed to find the global optimum the optimality landscape must be unimodal. Moreover, research has demonstrated that multiple maxima exist under the maximum likelihood principle. Therefore, hill climbing based evolutionary tree reconstruction methods often return local optima.

但是由于进化树的似然函数通常含有多个局部极优解，而爬山算法没有逃离局部极优的能力，因此基于爬山算法的进化树构建算法很容易陷入局部极优。

The uncertainty of travel time of road network is depicted by means of scenario union firstly,then a path finding modal applied minimax theorem is constructed for obtaining most reliable path of all scenarios.

该方法通过场景集描述网络旅行时间的不确定性，应用Minimax理论构建求解所有场景下可靠路径的数学模型，并设计了问题求解算法，分析了算法的时间复杂性，最后通过典型算例对算法进行了验证。

FMA decreases the computation complexity from O to O by decomposing the dense matrix in Moment Method into the combination form of four sparse matrix—Near interaction, Aggregation, Translation and Deaggregation matrix.

本文严格推导了二维和三维快速多极算法的各步骤，并根据其稀疏矩阵形式，讨论了该算法的计算量和存储量；提出了获得该算法众多参数选取规则的新途径，在理论上丰富和发展了该方法。

A automatic image morphing algorithm based on wavelet edge detection is presented.

改进了基于域的图象变形算法，较大地减小了变形算法的复杂度，提高了算法的运算速度。

Then proposes a video image pre-processing method based on adaptive neighborhood statistics. The proposed pre-processing conquers the low efficiency of classical adaptive neighborhood filter and the sensitivity to threshold in other methods.

提出了一种基于自适应邻域统计的视频图像预处理算法，该算法解决了自适应邻域滤波中邻域构建的效率问题和传统预处理算法的门限敏感问题。

But we don't care about Battlegrounds.

但我们并不在乎沙场中的显露。

Ah! don't mention it, the butcher's shop is a horror.

啊！不用提了。提到肉，真是糟透了。