中文模板 关 键 词: 多播;度约束;多播路由算法;分布式算法 [gap=8938]Key words: multicast; degree-constraint; multicast routing algorithm; distributed algorithm
基于8个网页-相关网页
360-degree constraint 三百六十度方位的约束
stability degree constraint 稳定度约束
the degree-constraint tree 度限制树
fuzzy constraint degree 模糊约束度
Complexity of the algorithm is 2Ο( n). In the above algorithm on the basis of two, we deduced the sufficient and necessary conditions of k-gree-constraint minimum spanning tree exist, and give a single point of k-degree-constraint minimum spanning tree algorithm.
在以上两个算法的基础上,我们推导得出了网络单点度约束最小树存在的充要条件,最后给出了单点度约束最小树算法,对已有的Glove-Klingman算法进行了改进,大量仿真实验表明改进后的算法是非常有效的。
参考来源 - 度约束最小生成树算法·2,447,543篇论文数据，部分数据来源于NoteExpress
Thus, the multicast capability of each node is represented in this paper by a degree-constraint.
为此，采用度约束来表示每个节点的多播能力，提出了一种有度约束的分布式多播路由算法。
A constraint is a restriction on the degree of freedom you have in providing a solution.
约束是对提供解决方案中的自由度的限制。
The optimal intensive degree refers to a maximum comprehensive intensive degree of an economic system under a set of constraint conditions.
最优集约度是指在一组约束条件下经济系统的最大综合集约度。
应用推荐