It is given an approximation algorithm for the problem.
本文给出该问题的一个近似算法。
First, an approximation algorithm for self-tuning regulator is suggested.
首先提出了自校正调节器的一种近似算法。
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.
给出了求解一类具有简单约束的上模集函数最小值问题的一种局部搜索法，并讨论了所给算法的性能保证。
For no-waited model, we show it is strongly NP-hard, and present a pseudo-polynomial time optimal algorithm and an approximation algorithm with worst-case ratio 5/3.
对于不可等待的情况证明了它是强NP-难的，并给出了动态规划算法和一个最坏情况界为5/3的近似算法。
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.
对于用近似算法求得的出分枝，又结合前面的规约规则设计了优化规则，以进一步通过优化变换增加出分枝的叶子节点。
This paper presents an algorithm of acquiring depth map using linear approximation based on gray level information. Using the algorithm, surface reconstruction can be easily realized.
该文提出了一种用线性逼近方法、基于灰度信息从图像获取物体深度信息，从而实现物体三维表面重建的算法。
The hinging hyperplanes model is improved and an indirect smooth approximation algorithm based on hinge-finding algorithm is proposed.
改进了链接超平面模型，并在找链接算法的基础上给出了一个处处光滑的间接光滑逼近算法。
The new algorithm can get an approximation solution for the scheduling quickly.
这个算法可以快速地得到这种延误问题的近似解。
Based on an algorithm of soft shadows for linear light, the author purposed an algorithm of soft shadows for area light by area approximation.
在线光源软阴影生成算法的基础上，作者提出了运用快速面积估计生成面光源的软阴影的算法。
An estimation of the approximation error, an algorithm for its implementation and some illustrative examples are included.
给出实现算法和数值解的近似误差估计以及数值实例。
Adaptive sampling algorithm of surface play an important role in evaluation of profile deviation and surface triangular approximation.
曲面轮廓度误差评价和多边域逼近均要求对理论曲面进行数字化自适应采样。
An improved approach to polygonal approximation of regular digital curves based on GA algorithm is presented.
提出了一种基于遗传算法的数字曲线多边形改进逼近方法。
An approximation-projection iterative algorithm is investigated.
同时也讨论了投影逼近迭代算法。
Then by utilizing the features of this model an online optimization algorithm that combines policy gradient estimation and stochastic approximation is derived.
然后利用这种模式的特点，在线优化算法相结合的策略梯度估计及随机逼近而得。
Using maximum approximation of differential Negentropy, an objective function for ICA is introduced and a Fast-ICA algorithm based on maximum Negentropy is presented.
使用差分最大负平均信息量的方法，一个为ica的目标函数和一个快速ica算法在文中被提出。
Using maximum approximation of differential Negentropy, an objective function for ICA is introduced and a Fast-ICA algorithm based on maximum Negentropy is presented.
使用差分最大负平均信息量的方法，一个为ica的目标函数和一个快速ica算法在文中被提出。
应用推荐