查询词典 algorithm

In chapter 4, an optimization Boolean operator of triangular mesh and the algorithm of adding point-swapping edge locally are put forward. With boundary traced by adding midpoint, the triangulation of 2D arbitrary domain is realized. The fast searching method which combines the index rectangle with compass based normal vector is designed to speed the triangulation algorithm.

第四章提出了一种优化的三角网格布尔运算和逐点加入—局部换边法，用中点加点法恢复边界，实现了二维任意域Delaunay三角化算法，用索引矩形和基于法矢的指南针法相结合的快速查询法有效地提高了三角化算法的速度，给出了二维任意域三角网格剖分的实例。

The de Boor algorithm and a knot insertion algorithm are also given for B-spline curves.

还给出B-样条曲线的de Boor算法和节点插入算法。

With the combination of Improved Adaptive Genetic Algorithm and Improved Bottom-Left heuristic algorithm,the packing of rectangles can be effectively solved.

提出了一种基于环形交叉算子和环形变异算子的自适应遗传算法，并将改进的自适应遗传算法和IBL启发式布局算法相结合，有效地解决了矩形排样优化问题。

This paper aims to study the algorithm for linear programming with bounded variables and a new algorithm is obtained.

本文对有界变量线性规划的算法进行了研究，得到了一种解此问题的新算法。

In the approach,two basic algorithms named grammar induction algorithm and alignment algorithm using Bracketing Transduction Grammar are adopted.

这种方法有两个基本的步骤。首先，通过语法归纳分别从源语言和目标语言中获取语义类和短语结构类。

For the above problem, two heuristic methods and a hybrid optimal algorithm that incorporates the branch and bound method with active schedule constru〓n algorithm are presented Computational results show the effectiveness of these methods.

对上述问题，给出了两个启发式方法和一个将分支定界法和活动调度构造算法相结合的混合最优算法。

Moreover, if the optimization problem has certain special feature, the simpler relaxation methods can be provided. For example, considering a generalized geometric programming problem, relevant relaxation linear programming can be obtained using its special structure. Based on the branch and bound method, a linear relaxation algorithm of global optimization is presented for generalized geometric programming, and the convergence of the algorithm is also proven.

此外，当优化问题具有某种特殊性质时，我们能给出更加简便的松弛化方法，如考虑广义几何规划问题，能充分利用其特殊结构，建立了广义几何规划问题的松弛线性规划问题；在分枝定界技术的基础上，提出了一个求广义几何规划全局解的线性松弛算法；证明了算法的收敛性。

An algorithm for branch bending based on dual-scale automaton model is developed. The algorithm needs only a few parameters, but can generate natural and realistic branch bending curve.

该算法虽然所需参数少，但能有效地生成自然逼真的枝条弯曲形状，并且能反映植物在生长中枝条的动态弯曲过程。

A novel phase unwrapping algorithm is presented based on the Goldstein S branch cut algorithm and the residue theorem.

在分析Goldstein枝切法和残差点位置的基础上，提出了一种改进的相位解缠算法。

The aim of the paper is to receive nodal impedance matrix by adding- branch line algorithm and admittance matrix algorithm, to analyze the effect of them, and to provide the models.

使用了支路追加法和导纳矩阵求逆法来形成节点阻抗矩阵，给出了两种算法的数学模型，分析了算法各自的特点和优势。

But we don't care about Battlegrounds.

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

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

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