全部

1·It is given an approximation algorithm for the problem.

本文给出该问题的一个近似算法。

2·A new fast polygonal approximation algorithm is presented.

提出一种新的多边形逼近算法。

3·A polynomial approximation algorithm for the problem is given.

同时，还给出了该问题的多项式时间近似算法。

4·First, an approximation algorithm for self-tuning regulator is suggested.

首先提出了自校正调节器的一种近似算法。

5·This thesis proposes a randomized approximation algorithm for the Set Cover problem.

提出了集合覆盖问题的一种随机近似算法。

6·Many numerical tests show that the fast approximation algorithm has very good performance.

大量的数值试验表明该近似算法性能良好。

7·Lower approximation algorithm and its solve of convex quadratic programming are also given in this article.

混合优化控制算法，给出了求解最优控制器的上逼近算法及其凸二次规划求解方法。

8·Finally, based on the theorem, a polynomial 2 approximation algorithm for the location problem is presented.

最后，基于此定理，给出了选址问题的一个多项式2近似算法。

9·Finally the approximation algorithm for the minimum weak vertex cover set is analyzed based on the maximal flow partition.

进一步分析了求解基于最大流划分的最小弱顶点覆盖集的近似算法。

10·It is also shown that the postman route obtained by this approximation algorithm is optimal if the given windy graph is Eulerian.

当所给风向图是欧拉图时，由这一近似算法求得的投递员路线是最优的投递员路线。