Due to the NP hard problem, it is not realistic to find the optimal decision tree. So researching kinds of heuristic algorithms to induce a decision tree with high accuracy becomes a focus.
由于NP困难,寻找最优的决策树是不现实的,从而探索各种启发式算法去产生一个高精度的决策树变成了这类研究的焦点。
Focuses on the algorithms of the minimum-delay spanning tree for the application-layer multicast, and proposes an improved BCT-H (balance compact tree-heuristic) algorithms based on strategy function.
文中着重研究构建最小延迟应用层组播树的算法,提出一种基于策略函数构造应用层最小直径组播树的启发式算法BCT - H。
应用推荐