minimum spanning tree

minimum spanning tree 基本解释

网络  最小生成树算法; 最小生成树; 算法; 最小生成樹; 最小支撑树

计算机

重点词汇

• treen. 树, 木料, 树状物 vt. 把...赶上树 [计] 树; DOS外部命令:显示指定磁盘驱动器的目录结构
• minimuma. 最小的, 最低的 n. 最小值 [计] 最小值
• spanning[计] 生成

minimum spanning tree 双语例句

1. 1、 Applications of Genetic Algorithm to Degree-Constrained minimum spanning tree
   遗传算法在度约束最小生成树问题中的应用
2. 2、 A Multi-Objective Evolutionary Algorithm Based on minimum spanning tree
   一种基于最小生成树的多目标进化算法
3. 3、 An Efficient Discrete Particle Swarm Optimization Algorithm for Multi-Criteria minimum spanning tree
   一种求解多目标最小生成树问题的有效离散粒子群优化算法
4. 4、 Distribution Network Comprehensive Optimization Based on minimum spanning tree Algorithm and Improved Genetic Algorithms
   基于最小生成树算法和改进遗传算法的配电网络综合优化
5. 5、 Novel connected dominating set algorithm based on minimum spanning tree
   基于最小生成树的连通支配集求解算法
6. 6、 The proposed model is considered as a typical partial minimum spanning tree problem from the mathematical point of view.
   以寻找最短的加权送电路径为优化目标，将网络重构建模为一个寻找图的局部最小树问题，并计及各种约束。
7. 7、 Application of minimum spanning tree in the greedy multicast routing algorithm
   最小生成树在动态贪婪多播路由算法中的应用
8. 8、 Inverse Cost Limit of Constrained minimum spanning tree Problem Under Hamming Distance
   哈明距离下费用受限制约束最小支撑树反问题
9. 9、 Improved ACS Algorithm for Solving Degree-Constrained minimum spanning tree
   求解度约束最小生成树的改进ACS算法
10. 10、 Research on minimum spanning tree based on prim algorithm
    基于Prim算法的最小生成树优化研究
11. 11、 Study of minimum spanning tree Routing Algorithm in LEACH
    基于最小生成树的LEACH路由算法研究
12. 12、 The minimum spanning tree ( MST) was used to obtain the best connected-component of the image set to recover the transformation between images and project the images into the mosaic frame.
    根据最小生成树（MST）算法获得图像序列的连通分量，得到图像对之间的变换矩阵并将图像映射到拼接平面。
13. 13、 Method for spectral correspondence based on minimum spanning tree combined with probabilistic relaxation
    基于最小生成树与概率松弛结合的谱匹配算法
14. 14、 In addition, by studying the traffic flow distribution rule in the minimum spanning tree, it is found that the proportion of the minimum spanning tree in the total system is close to a constant.
    此外，通过研究最小支撑树上的流量分布规律，发现最小支撑树上流量占总系统流量的比例接近于一个常数。
15. 15、 Research on bi-criteria minimum spanning tree problem based on ant colony system;
    蚁群系统是近年来发展起来的解决组合优化问题的一种有效方法。
16. 16、 Zero Initialization of Spatial Data and minimum spanning tree Algorithm in Presence of Arbitrary Obstacles
    空间数据的零初始化与障碍空间下的最小生成树实现方法
17. 17、 The initial clustering structure is constructed by using the minimum spanning tree method.
    然后使用最小生成树方法得到聚类的初始结构；
18. 18、 Secondly, a novel Genetic algorithm for the degree constrained minimum spanning tree problem is presented.
    其次，本文提出了一种求解度约束最小生成树问题的遗传算法。
19. 19、 For the degree constrained minimum spanning tree problem, the basic ant algorithm is improved.
    针对度约束最小生成树问题，对基本的蚁群算法进行改进。
20. 20、 A new algorithm based on the minimum spanning tree theory of graph was proposed which improved the computation efficiency and reliability of previous methods.
    对基于图的最小生成树理论的算法进行了改进，新算法在效率和可靠性方面都有所提高；
21. 21、 Complexity and Algorithm of the minimum spanning tree Problem with Multiple Parameter
    多参数最小支撑树问题的复杂性和算法
22. 22、 This paper used algorithm of minimum spanning tree to realized multi-join queries of distributed database and provided analyzing method.
    本文用最小生成树算法实现了分布式数据库中的多元连接查询，并进行了算法的分析与设计。
23. 23、 According to the character of the problem, a DNA algorithm solving the minimum spanning tree Problem is given.
    根据问题的特征，提出了一个求解最小支撑树问题的DNA算法。
24. 24、 Application of Genetic Algorithm in minimum spanning tree The concept of minimum spanning tree is introduced and its limitation is analyzed.
    介绍了最小生成树的概念，分析了最小生成树在实际应用中的局限性。
25. 25、 With the example of using genetic algorithm to get minimum spanning tree, the author encodes a graph simulating the topology of real network, builds a corresponding model and makes analysis on it.
    且结合运用遗传算法求解图的最小生成树的例子，对一个模拟网络拓扑结构的有权无向图进行了编码，为求解过程建立了相应的模型，并对该模型进行了分析。
26. 26、 Third, an efficient enumeration algorithm is proposed for solving the constrained minimum spanning tree problem.
    第三，对带约束的最小生成树问题给出了一种有效的枚举算法。
27. 27、 Based on the discussion, efficient parallel algorithms for the shortest paths and the minimum spanning tree are proposed.
    并在该模型上给出关于最短路与最小生成树的高效算法，以及在实际并行计算机系统上实现的方法。
28. 28、 The model of minimum spanning tree with multiple parameter is established.
    建立了多参数最小支撑树问题（RMST）的模型，并证明该问题是NP-完全的。
29. 29、 This thesis employs the minimum spanning tree method to study the classification of the stocks.
    本文基于最小生成树算法研究股票市场的分类问题。