算法框架:算法重定位的一种可操作的方法  

Algorithm Framework: an Operational Approach to Algorithm Relocation

作　　者：栾尚敏[1] 李未[1] 马绍汉[2] 

机构地区：[1]北京航空航天大学计算机科学与工程系,北京100083 [2]山东大学计算机科学系,济南250100

出　　处：《软件学报》1999年第7期679-684,共6页Journal of Software

基　　金：国家自然科学基金

摘　　要：算法框架是实现算法重定位的一种可操作的方法．文章给出了算法重定位的定义，讨论了如何通过选择操作和组合操作来设计算法框架．然后给出了定义选择操作和组合操作的一种方法．由文章所定义的算法框架得到求解某一问题的算法模式，从该算法模式就可以生成求解该问题的算法．文章最后讨论了算法框架和算法模式以及模块化算法之间的关系．Algorithm framework is an operational approach to algorithm relocation. In this paper, the authors present the definition of algorithm relocation and an algorithm framework based on selection operator and combination operator. The authors discuss how to design selection operator and combination operator. The algorithm for a given problem can be obtained from the algorithm schema, which is obtained from the algorithm framework presented in this paper. The relationship between algorithm framework and algorithm schema and the relationship between algorithm framework and modular algorithm are discussed as well. Algorithm relocation and its operational approach are significant for software automation and machine learning.

关 键 词：算法设计 软件自动化 算法重定位 算法框架 

分 类 号：TP311.51[自动化与计算机技术—计算机软件与理论] TP301.6[自动化与计算机技术—计算机科学与技术]