an approximate algorithm of LLR LLR近似算法
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.
它是一种用分段逼近函数近似代替连续函数，作连续傅氏变换的近似算法。
应用推荐