仿真结果表明该模型可行，能对被动式声纳浮标搜潜的目标定位提供算法依据。
The results of simulation suggest that this model is feasible and it can provide some reference to target-location algorithms for passive sonar-buoy to search submarines.
该算法包括三个阶段：最小生成树聚类、聚类簇重组和禁忌搜素优化。
The proposed algorithm, TABU-Clustering, is com - posed of three stages: minimum spanning tree clustering, recombination of clusters and tabu search optimization.
但是我们能在可容忍的空间使用增加上，进一步提高它的时间效率吗？我们需要分析三元搜素树的算法与结构。
But can we make it more efficient in time with a tolerable space increment? We need to analyse the algorithm and the data structure of ternary search tree.
从简单普适的穷搜(ES)法出发分别建立了降维搜索(RS)算法和AI算法，从而大幅度缩小了搜索空间。
Based on the simple exhaustive search (es) method, a reduced-space search (RS) algorithm and an AI algorithm are developed respectively, which make the search space reduced dramatically.
从简单普适的穷搜(ES)法出发分别建立了降维搜索(RS)算法和AI算法，从而大幅度缩小了搜索空间。
Based on the simple exhaustive search (es) method, a reduced-space search (RS) algorithm and an AI algorithm are developed respectively, which make the search space reduced dramatically.
应用推荐