摘要
结合并行处理思想,对动态规划中的顺序(逆序)递推算法进行改进,改进算法在搜索结果上与原算法相同,但搜索速度明显优于原算法。
Thinking about parallel processing,this paper improves the two algorithms forward and backward.The improved one's searching result is the same as the original one,but the former is faster than the latter in respect of searching speed.
出处
《青岛大学学报（自然科学版）》
CAS
2003年第4期93-97,共5页
Journal of Qingdao University(Natural Science Edition)
