| 注册
首页|期刊导航|计算机工程|一种多函数间的递归消除方法

一种多函数间的递归消除方法

潘欣 石川

计算机工程2012,Vol.38Issue(3):37-38,42,3.
计算机工程2012,Vol.38Issue(3):37-38,42,3.DOI:10.3969/j.issn.1000-3428.2012.03.013

一种多函数间的递归消除方法

Recursion-removal Method Among Multi-function

潘欣 1石川1

作者信息

  • 1. 北京邮电大学智能通信软件与多媒体北京市重点实验室,北京100876
  • 折叠

摘要

Abstract

In order to solve the recursion problems involving several functions, this paper proposes a systematic recursion-removal method. It cuts the calls among different functions through artificial stack and replaces the recursions inside each function with iteration. It also researches on the relation between recursion-removal depth and the programs' time efficiency. Experiments prove that it can successfully remove the recursion of dominating tree and double the time efficiency before recursion-removal.

关键词

递归消除/系统栈/人工栈/一门多锁

Key words

recursion-removal/ system stack/ artificial stack/ a door with several keys

分类

信息技术与安全科学

引用本文复制引用

潘欣,石川..一种多函数间的递归消除方法[J].计算机工程,2012,38(3):37-38,42,3.

基金项目

国家自然科学基金资助项目(60905025,90924029) (60905025,90924029)

国家“863”计划基金资助项目(2009AA04Z136) (2009AA04Z136)

计算机工程

OACSCDCSTPCD

1000-3428

访问量0
|
下载量0
段落导航相关论文