论文部分内容阅读
为探究启发式边排序策略性能和网络结构特征的相关性,并建立网络结构特征依赖的边排序策略选择方法,基于4种常用的规则网络对BFS(breadth-first search)和POS(priority ordering search)两种策略的性能展开研究。通过试验分析比较了4种网络下BFS和POS两种策略的BDD(binary decision diagram)尺度与总体运行时间等性能数据。研究结果表明:在规则网络结构中,不同的排序策略适用于不同的网络结构。在Torus和Square网络中BFS策略优于POS策略;在De Bruijn和Nearest-neighbor网络中POS策略普遍优于BFS策略。该结论为特定网络选取最优或次优启发式边排序策略提供了依据。
In order to explore the correlation between heuristic edge sorting strategy performance and network structure characteristics and to establish the edge ordering strategy selection method based on network structure feature dependence, this paper proposes a novel algorithm based on four commonly used rule networks, breadth-first search (BFS) and priority ordering search The performance of the two strategies to conduct research. The performance data of BDF (binary decision diagram) scale and overall running time of two kinds of BFS and POS strategies under four networks are analyzed and compared through experiments. The results show that different ordering strategies apply to different network structures in the regular network structure. BFS strategy is superior to POS strategy in Torus and Square networks; POS strategy is generally better than BFS strategy in De Bruijn and Nearest-neighbor networks. This conclusion provides the basis for selecting the optimal or suboptimal heuristic edge sorting strategy for a specific network.