摘要
针对当前采用的的宽度优先证书构造算法在处理复杂的CA拓扑图时非常消耗内存空间和计算时间的问题。提出了一种优化的基于A*算法的证书路径构造方案,并给出了几种A*算法中估价函数h(x)的取值方法以提高算法的处理效率。
For current method of ceritfication path construction based on the theory of breadth first costs memory and time a lot in the case of processing a complicated CA topological graph, we presented a novel scheme of ceritfication path construction based on A -star algorithm,and several value setting methods of the evaluation function h（x） are introduced to ensure the effectiveness of the algorithm,which is also demenstrated in theory.
出处
《南昌大学学报（理科版）》
CAS
北大核心
2008年第6期592-595,共4页
Journal of Nanchang University(Natural Science)
基金
江西省科技厅攻关资助项目(2007BG09605)
