It is given an approximation algorithm for the problem.
本文给出该问题的一个近似算法。
A new fast polygonal approximation algorithm is presented.
提出一种新的多边形逼近算法。
A polynomial approximation algorithm for the problem is given.
同时，还给出了该问题的多项式时间近似算法。
First, an approximation algorithm for self-tuning regulator is suggested.
首先提出了自校正调节器的一种近似算法。
This thesis proposes a randomized approximation algorithm for the Set Cover problem.
提出了集合覆盖问题的一种随机近似算法。
Many numerical tests show that the fast approximation algorithm has very good performance.
大量的数值试验表明该近似算法性能良好。
Finally, based on the theorem, a polynomial 2 approximation algorithm for the location problem is presented.
最后，基于此定理，给出了选址问题的一个多项式2近似算法。
Finally the approximation algorithm for the minimum weak vertex cover set is analyzed based on the maximal flow partition.
进一步分析了求解基于最大流划分的最小弱顶点覆盖集的近似算法。
It is also shown that the postman route obtained by this approximation algorithm is optimal if the given windy graph is Eulerian.
当所给风向图是欧拉图时，由这一近似算法求得的投递员路线是最优的投递员路线。
By normalizing the total processing time, we present an approximation algorithm and investigate its competitive ratio proved to be tight.
将总加工时间标准化后，给出近似算法及其竞争比，并证明此竞争比是紧的。
An approximation algorithm is presented for minimizing a nondecreasing supermodular set function, and its performance guarantee is probed.
给出了求解一类具有简单约束的上模集函数最小值问题的一种局部搜索法，并讨论了所给算法的性能保证。
Simulation results show that with complexity greatly reduced, piecewise linear approximation algorithm achieve a performance very close to that of the BP algorithm.
仿真结果表明，曲线折线化算法在复杂度大幅度降低的情况下性能接近BP算法。
Comparing with the traditional code tracking method, it is made for fast synchronization and maintenance. It also avoids the error of the JPL approximation algorithm.
与传统的码跟踪方法相比，更有利于迅速同步和稳定保持，避免了JPL近似算法带来的误差。
A smoothing approximation algorithm for nonlinear complementarity problems was introduced and the global convergence of the algorithm was proved under milder conditions.
提出了求解非线性互补问题的一个光滑逼近算法，在一定条件下证明了该算法的全局收敛性。
A successive approximation algorithm of feedforward and feedback optimal control for linear systems with state time-delay affected by persistent disturbances is presented.
针对外部持续扰动下的线性时滞系统，提出一种前馈-反馈最优控制的逐次逼近算法。
The fading factor restricts the length of the data which processed by the Kalman filter. And we use"one step"approximation algorithm to calculate the suboptimal fading factor.
引入的渐消因子限制了卡尔曼滤波中处理数据的长度，采用一步近似算法对次优渐消因子进行计算。
An approximation algorithm was given to find an out-branching with many leaves in the reduced digraph. Furthermore, some optimization rules were given to improve the out-branching.
对于用近似算法求得的出分枝，又结合前面的规约规则设计了优化规则，以进一步通过优化变换增加出分枝的叶子节点。
In the first we introduce basic notions of scheduling problems, competitive analysis and approximation algorithm, summarize semi online models and their results which appear in recent years.
本文首先简要介绍了排序问题、竞争比分析和近似算法等基本概念，总结了近年来出现的各个半在线模型及其有关结果。
The best uniform approximation algorithm to approach the catenary suspension and the CAD system using this algorithm to design the catenarian dome of hot blast stove are described in the paper.
介绍了采用最佳一致逼近法对悬链线进行逼近，以及运用此算法进行热风炉悬链线拱顶设计的CAD系统。
The best uniform approximation algorithm to approach the catenary suspension and the CAD system using this algorithm to design the catenarian dome of hot blast stove are described in the paper.
介绍了采用最佳一致逼近法对悬链线进行逼近，以及运用此算法进行热风炉悬链线拱顶设计的CAD系统。
应用推荐