The distance vector routing (DVR) algorithm for routing choice and count-to-infinity problem in itself is introduced first.
首先介绍了用于路由选择的DVR(距离矢量路由)算法及其存在的无穷计算问题。
Since word order similarity is the main factor to the ranking results, an algorithm based on vector distance is devised to compute word order similarity in this paper.
由于词序相似度是影响简拼搜索排序结果的主要因素，该文提出了基于向量距离计算词序相似度的算法。
Under this premise, the algorithm of data simplification is offered which combines the method of distance threshold with the one of vector angle.
以此为前提，提出了距离阈值法和向量角度法相结合的数据精简算法。
Absrtact: The distance vector routing (DVR) algorithm for muting choice and count - to - infinity problem in itself is introduced first.
摘要：首先介绍了用于路由选择的DVR(距离矢量路由)算法及其存在的无穷计算问题。
The thesis describes some solutions for the slow convergence (count to infinite) problem in Vector-Distance algorithm in TCP/IP and points some shortages of them.
论述了TCP/IP网络中距离向量（V D）算法中的慢收敛问题，以及一些解决方法的不足。
The thesis describes some solutions for the slow convergence (count to infinite) problem in Vector-Distance algorithm in TCP/IP and points some shortages of them.
论述了TCP/IP网络中距离向量（V D）算法中的慢收敛问题，以及一些解决方法的不足。
应用推荐