... 循环信念传播(Loopy belief propagation) 连接树算法(Junction tree algorithm) 无信息先验(uninformative priors) ...
基于6个网页-相关网页
实验结果表明该算法在减少非-DHT连接数量和降低树的加权半径方面相对于其它相关算法有了较大的改进。
The simulation results show that the algorithm gains a greater improvement than other corresponding algorithms on reducing non-DHT links and the weighted radius of multicast tree.
基于实验对比结果，选定一种能够保证ALM算法稳定性的连接序列，实现低错误率alm树的建立。
Based on the experimental results, it chooses one sequence which ensures the stability of ALM algorithm to low error rate of ALM tree construction.
在程序的算法中，也要确保优先级队列中不能有连接已在树中的顶点的边。
In a programming algorithm we must likewise make sure that we don't have any edges in the priority queue that lead to vertices that are already in the tree.
应用推荐