General solution scheme to spatial complexity of recursive algorithm

Yong Sun; Xuan Wang

doi:10.1109/ICMLC.2006.258522

General solution scheme to spatial complexity of recursive algorithm

Yong Sun^*
, Xuan Wang

^*Corresponding author for this work

Shenzhen Polytechnic
Harbin Institute of Technology Shenzhen

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

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.

Original language	English
Title of host publication	Proceedings of the 2006 International Conference on Machine Learning and Cybernetics
Pages	952-956
Number of pages	5
DOIs	https://doi.org/10.1109/ICMLC.2006.258522
State	Published - 2006
Externally published	Yes
Event	2006 International Conference on Machine Learning and Cybernetics - Dalian, China Duration: 13 Aug 2006 → 16 Aug 2006

Publication series

Name	Proceedings of the 2006 International Conference on Machine Learning and Cybernetics
Volume	2006

Conference

Conference	2006 International Conference on Machine Learning and Cybernetics
Country/Territory	China
City	Dalian
Period	13/08/06 → 16/08/06

Keywords

Recursive algorithm
Recursive tree
Spatial complexity

Access to Document

10.1109/ICMLC.2006.258522

Cite this

@inproceedings{17dd4c0ceb244a1da83d845adb93d2e3,

title = "General solution scheme to spatial complexity of recursive algorithm",

abstract = "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.",

keywords = "Recursive algorithm, Recursive tree, Spatial complexity",

author = "Yong Sun and Xuan Wang",

year = "2006",

doi = "10.1109/ICMLC.2006.258522",

language = "英语",

isbn = "1424400619",

series = "Proceedings of the 2006 International Conference on Machine Learning and Cybernetics",

pages = "952--956",

booktitle = "Proceedings of the 2006 International Conference on Machine Learning and Cybernetics",

note = "2006 International Conference on Machine Learning and Cybernetics ; Conference date: 13-08-2006 Through 16-08-2006",

}

Sun, Y & Wang, X 2006, General solution scheme to spatial complexity of recursive algorithm. in Proceedings of the 2006 International Conference on Machine Learning and Cybernetics., 4028200, Proceedings of the 2006 International Conference on Machine Learning and Cybernetics, vol. 2006, pp. 952-956, 2006 International Conference on Machine Learning and Cybernetics, Dalian, China, 13/08/06. https://doi.org/10.1109/ICMLC.2006.258522

General solution scheme to spatial complexity of recursive algorithm. / Sun, Yong; Wang, Xuan.
Proceedings of the 2006 International Conference on Machine Learning and Cybernetics. 2006. p. 952-956 4028200 (Proceedings of the 2006 International Conference on Machine Learning and Cybernetics; Vol. 2006).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - General solution scheme to spatial complexity of recursive algorithm

AU - Sun, Yong

AU - Wang, Xuan

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

KW - Recursive algorithm

KW - Recursive tree

KW - Spatial complexity

UR - https://www.scopus.com/pages/publications/33947245617

U2 - 10.1109/ICMLC.2006.258522

DO - 10.1109/ICMLC.2006.258522

M3 - 会议稿件

AN - SCOPUS:33947245617

SN - 1424400619

SN - 9781424400614

T3 - Proceedings of the 2006 International Conference on Machine Learning and Cybernetics

SP - 952

EP - 956

BT - Proceedings of the 2006 International Conference on Machine Learning and Cybernetics

T2 - 2006 International Conference on Machine Learning and Cybernetics

Y2 - 13 August 2006 through 16 August 2006

ER -

General solution scheme to spatial complexity of recursive algorithm

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this