本文给出该问题的一个近似算法。
本文对其提出一种简便的近似算法。
介绍一种电网谐波的近似算法。
An algorithm for analyzing the approximate power harmonics is also presented.
提出了吹雪机问题的改进近似算法。
This paper proposes several approximation algorithms to improve the solution of snowblower problem.
首先提出了自校正调节器的一种近似算法。
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.
介绍了配送问题的两个数学模型及近似算法。
Two maths models and the approximate algorithm of distribution transportation are introduced.
同时，还给出了该问题的多项式时间近似算法。
A polynomial approximation algorithm for the problem is given.
本文同时对该近似算法所产生的误差进行了分析。
We also analyse the error produced by this approximate algorithm.
数值散射是辐射传递方程近似算法中最常见的离散误差。
Numerical scattering is one of the most common discretization errors in the numerical method for radiative transfer equation.
状态空间的最优控制体系是保守的，其近似算法应当保辛。
Optimal control system of state space is a conservative system, whose approximate method should be symplectic conservation.
最后，基于此定理，给出了选址问题的一个多项式2近似算法。
Finally, based on the theorem, a polynomial 2 approximation algorithm for the location problem is presented.
这种拟物的方案可为许多NP难度的问题得出有价值的近似算法。
It is pointed out that valuable approximate algorithms can be obtained for large Numbers of NP hard problems by following the quasi-physical procedure.
进一步分析了求解基于最大流划分的最小弱顶点覆盖集的近似算法。
Finally the approximation algorithm for the minimum weak vertex cover set is analyzed based on the maximal flow partition.
若要求最大检测时间最小，证明了其是NP完全问题，并给出近似算法。
If the maximum detection time is required to be minimal, the problem is proved to be NP completeness and an approximate algorithm is given.
同时，运用叠加原理得出了近似算法并与数值计算方法进行对比研究。
Subsequently, the approximate arithmetic making use of superpose principle is researched in contrast with numeric arithmetic.
许多近似算法能够有效进行频繁项挖掘，但不能有效控制内存资源消耗。
Many approximation algorithms behave well in frequent items mining, but can not control their memory consumption.
为了克服这些困难，提出了一种基于序列二次近似算法精确的对偶映射。
In order to overcome the difficulties, a sequential quadratic approximate algorithm is proposed based on exact dual mapping.
提出一种更新移动目标最短路径树的近似算法来避免重新生成整棵路径树。
This paper presents an approximate algorithm for updating the shortest path tree of moving target to avoid re-generate the whole tree.
它是一种用分段逼近函数近似代替连续函数，作连续傅氏变换的近似算法。
It is an approximate algorithm of continuous Fourier transform in which some approaching functions of segments are approximately used instead of continuous functions.
将总加工时间标准化后，给出近似算法及其竞争比，并证明此竞争比是紧的。
By normalizing the total processing time, we present an approximation algorithm and investigate its competitive ratio proved to be tight.
研究了极小布尔不可满足子式的提取算法，它分为近似算法和精确算法两种。
The paper is concerned with the algorithms for extraction of minimal unsatisfiable (mu) Boolean sub-formula. The algorithms include approximate and exact methods.
当所给风向图是欧拉图时，由这一近似算法求得的投递员路线是最优的投递员路线。
It is also shown that the postman route obtained by this approximation algorithm is optimal if the given windy graph is Eulerian.
根据求解数学期望的近似算法，提出了一种新的随机可靠性灵敏度分析的通用方法。
On the basis of approximate algorithm for expectation, a general RS algorithm is presented.
提出了一种计算海量平面点集凸壳的快速近似算法——点集坐标旋转法（PSCR）。
The paper presents an efficient approximate algorithm for Convex Hull of very large planar point set. That is Point Set Coordinate Rotation Algorithm(PSCR).
但是现实交通网络可靠性的精确计算是非常难的，为此，需要寻求一个有效的近似算法。
But the precise computation of realistic traffic network reliability is NP difficult, therefore, we need to seek an effective approximate method.
同时还给出了离散最优控制的近似算法，并以国内H—L注水开发油田为实例进行了试算。
We also give the approximate algorithm of dispersed optimum control model, and compute the numerical value of our country's h-l water injection developing oilfield as an example.
并且对这两类问题都研究了他们的计算复杂性并给出了最优算法或者多项式时间近似算法。
For both problems, we study their computational complexity and present optimal algorithms or polynomial time approximation algorithms.
并且对这两类问题都研究了他们的计算复杂性并给出了最优算法或者多项式时间近似算法。
For both problems, we study their computational complexity and present optimal algorithms or polynomial time approximation algorithms.
应用推荐