GENERAL SOLUTION SCHEME TO SPATIAL COMPLEXITY OF RECURSIVE ALGORITHM

摘要：

Recursive algorithm (RA) need a great number of storage space for continue operations (such as push) on stack, which easily causes stack overflow. In the paper, we present a novel recursive algorithm to solve this intractability throw constructing recursive tree, which only restoring valuable data for decreasing the spatial complexity, and then traversing recursive tree. In this way, the problem of spatial complexity of recursive algorithm could be solved effectively, making recursive algorithm more practical in application.

关键词： Recursive algorithm Recursive tree Spatial complexity

作者: YONG SUN XUAN WANG

作者单位: School of Electronics and Information Engineering, Shenzhen Polytechnic, Shenzhen 518055, China Dept.of computer science, Harbin Institute of Technology Shenzhen Graduate School, Shenzhen 518055,C

会议类型: 国际会议

会议名称: 2006 International Conference on Machine Learning and Cybernetics(IEEE第五届机器学习与控制论坛)

会议地点: 大连

会议语种:英文

页码: 952-956

在线出版日期: 2006-08-13（万方平台首次上网日期，不代表论文的发表时间）