This paper presents an approximate algorithm for updating the shortest path tree of moving target to avoid re-generate the whole tree.
提出一种更新移动目标最短路径树的近似算法来避免重新生成整棵路径树。
If the maximum detection time is required to be minimal, the problem is proved to be NP completeness and an approximate algorithm is given.
若要求最大检测时间最小，证明了其是NP完全问题，并给出近似算法。
It is an approximate algorithm of continuous Fourier transform in which some approaching functions of segments are approximately used instead of continuous functions.
它是一种用分段逼近函数近似代替连续函数，作连续傅氏变换的近似算法。
We derived an approximate algorithm from geocentric to geodetic coordinates. The algorithm is very simple, but its accuracy can satisfied general geo-science research.
给出了一种由地心坐标到大地坐标的近似算法，这种算法非常简单，但它的精度可以满足一般地学研究的需要。
Furthermore, an approximate algorithm is pro-posed to compute the kinetic spectrum of each species, thus making the method effective as well for reactions with fractional orders.
提出用近似计算法计算各组分的动力学谱，使该方法能适用于任意反应级数的体系。
Furthermore, an approximate algorithm is pro-posed to compute the kinetic spectrum of each species, thus making the method effective as well for reactions with fractional orders.
提出用近似计算法计算各组分的动力学谱，使该方法能适用于任意反应级数的体系。
应用推荐