• The concept of minimum spanning tree is introduced and its limitation is analyzed.

    介绍了最小生成概念分析了最小生成树在实际应用中的局限性

    youdao

  • The initial clustering structure is constructed by using the minimum spanning tree method.

    然后使用最小生成方法得到聚类初始结构

    youdao

  • The experiment results show that it is effective on solving Degree - constrained Minimum Spanning Tree Problem.

    实验结果表明这种遗传算法解决约束最小生成问题有效的。

    youdao

  • According to the character of the problem, a DNA algorithm solving the Minimum Spanning Tree problem is given.

    根据问题特征提出一个求解最小支撑问题的DNA算法

    youdao

  • In this paper, considering the cost of the node degree, a Generalized Minimum Spanning Tree modal is presented.

    本文考虑节点代价问题,提出了广义最小生成树的概念,并分析了最小生成树在实际应用中的局限性。

    youdao

  • Algorithm design and analysis of the classic procedure, mainly 0-1 knapsack problem, such as minimum spanning tree.

    算法设计分析经典程序主要有0 - 1背包问题最小生成

    youdao

  • In this paper, a parthenogenetic algorithm for solving the degree-constrained minimum spanning tree problem is proposed.

    提出求解度约束最小生成问题单亲遗传算法

    youdao

  • The proposed model is considered as a typical partial minimum spanning tree problem from the mathematical point of view.

    以寻找最短的加权送电路径优化目标,将网络重构建模一个寻找图的局部最小问题,并计及各种约束。

    youdao

  • Base on solving the problem of degree-constrained minimum spanning tree, we put forward a new method to solving clustering problem.

    求解度限制问题基础上,提出了基于蚂蚁算法的聚类分析方法

    youdao

  • This paper used algorithm of minimum spanning tree to realized multi-join queries of distributed database and provided analyzing method.

    本文最小生成算法实现了分布式数据库中的多元连接查询,并进行了算法分析与设计。

    youdao

  • Based on the logical structure of minimum spanning tree, a stability degree constraint model is established and the laying scheme is given.

    最小生成逻辑结构建立稳定性约束模型,给出满足度约束铺设方案

    youdao

  • The proposed algorithm, TABU-Clustering, is com - posed of three stages: minimum spanning tree clustering, recombination of clusters and tabu search optimization.

    算法包括三个阶段最小生成类、聚类簇重组禁忌搜优化

    youdao

  • This paper presents an extended double list storage structure based on a double list storage structure and then applies it to the minimum spanning tree algorithm.

    在图链式存储结构基础提出了扩展的双链式存储结构。

    youdao

  • The capacitated minimum spanning tree problem (CMST), one of the most fundamental problems in telecommunications and in the optimal design of networks, is studied.

    研究流量约束最小生成问题CMST),它通讯网络优化设计最为基础和重要问题之一

    youdao

  • Design requirements: the use of algorithms for network Prims minimum spanning tree to the text of the various forms of output spanning tree edges and their weights.

    设计要求利用Prims算法最小生成文本形式输出生成树中各条以及它们的权值。

    youdao

  • A new real-time reconfiguration approach for large-scale distribution system, based on the minimum spanning tree algorithm and the switch exchange method, is presented.

    提出了利用最小算法开关交换方法进行大规模配电网重构方法

    youdao

  • In order to lower the scale of the problem and shorten the running time of algorithm, we propose a problem-dividing method based on minimum spanning tree to solve the TSP.

    本文提出基于最小生成TSP问题分块求解算法,以此达到降低问题规模缩短算法运行时间的目的。

    youdao

  • 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)算法获得图像序列连通分量,得到图像对之间变换矩阵图像映射拼接平面。

    youdao

  • According to the related optimizing theory, the Minimum Spanning Tree arithmetic and the Rectilinear SteinerMinimum Tree arithmetic were selected as the solution of the problem in this thesis.

    然后根据相关优化理论,提出了求解时间目标数学模型最小生成算法求解距离目标数学模型的最小矩形斯坦纳树算法。

    youdao

  • 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.

    此外通过研究最小支撑树上流量分布规律发现最小支撑树上流量占总系统流量比例接近一个常数。

    youdao

  • The paper studies the application layer multicast networks of MSNs, and presents a heuristic BCT algorithm for degree-constrained minimum diameter spanning tree problem.

    本文研究了由MSN节点组成应用层组播网络提出了度约束最小直径生成树问题,给出了求解该问题的BCT算法

    youdao

  • This paper discusses the application of adjacency matrix at the algorithm's analysis for traversing Graph, Minimum cost Spanning Tree, Topological sort and Critical Path.

    邻接矩阵遍历最小生成拓扑排序关键路径算法分析应用作了一定的探讨

    youdao

  • First, this paper analyzes degree-constraint minimum diameter spanning tree algorithm - the CT algorithm, and proposes the improved CT algorithm.

    首先本文有效的分析了受限最小直径生成算法-CT算法,提出改进的CT算法。

    youdao

  • A routing protocol for wireless sensor networks was proposed. The protocol used a data aggregation scheme of minimum transmission cost spanning tree.

    提出一种针对无线传感器网络路由协议,该路由采用最小传输成本生成树的数据汇聚机制

    youdao

  • Last, the partition algorithm which has been improved is proposed, meanwhile, the basic idea of Minimum Cost Spanning tree is presented.

    最后给出改进基于划分聚类方法,以及其中涉及到的最小生成算法基本思想

    youdao

  • The minimum labeling spanning tree(MLST) problem is an NP-hard problem in which, given a graph with labeled edges, one seeks a spanning tree with the least number of labels.

    最小标记生成就是其中之一,目标给出一个边上带有颜色的,计算使用颜色种类最少的生成树。

    youdao

  • Based on the characteristics of the wireless sensor networks, a data aggregation scheme of minimum transmission cost spanning tree is designed.

    针对传感器网络特点,提出了一种最小传输成本生成数据汇聚机制。

    youdao

  • Based on the characteristics of the wireless sensor networks, a data aggregation scheme of minimum transmission cost spanning tree is designed.

    针对传感器网络特点,提出了一种最小传输成本生成数据汇聚机制。

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定