1) partial minimum spanning tree
局部最小树
1.
The proposed model is considered as a typical partial minimum spanning tree problem from the mathematical point of view.
以寻找最短的加权送电路径为优化目标,将网络重构建模为一个寻找图的局部最小树问题,并计及各种约束。
2) local minimum spanning tree
局部最小生成树
1.
Then cluster heads run the local minimum spanning tree algorithm(MST) to construct a suitable topology.
利用分簇思想将网络划分为可重叠的簇,簇内各节点按照局部最小生成树算法思想确定邻居关系,调整发送功率,生成合适的网络拓扑。
3) local minimum
局部最小
1.
Based on the theory of the minimum spanning tree with changing weight,it is easy to get into the local minimum when routine optimization algorithm is used to optimize the plane layout of sewerage network under multi-restrict conditions.
在约束条件复杂的情况下,采用变权值最小生成树理论优化排水管网平面布置时易得出局部最小的次优解。
2.
The method to avoid local minimum and the selections of learning method, learning step length, learning samples and activating function are introduced especially.
尤其对学习方法的选择、隐层数和隐层单元数的选择、学习步长的选择、避免局部最小的方法、学习样本的选择、激活函数的选择等都作了详细的介
3.
Simulations and experiments show this algorithm possesses good performance, and can overcome the problem caused by local minimum.
利用虚拟水流法可以解决势场法中的局部最小的问题。
4) Local And Global Minimum
局部和全局最小
5) optimum base
最佳局部余弦树
6) local shortest path tree
局部最短路径树
补充资料：局部
一部分；非全体：～麻醉 ㄧ～地区有小阵雨。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条