首页 | 官方网站   微博 | 高级检索  
     

参数算法的实现研究
引用本文:张祖平,周苗苗,陈建二.参数算法的实现研究[J].计算机科学,2005,32(7):228-230.
作者姓名:张祖平  周苗苗  陈建二
作者单位:中南大学信息科学与工程学院,长沙,410083
基金项目:国家自然科学基金(60373083),长江学者奖励计划资助
摘    要:参数算法在工业制造和生物化学等很多领域得到了广泛的应用。在典型的参数算法中,有界搜索树和动态规划是常用技术。论文以代表性的可重构阵列瑕点覆盖参数算法为例,论述了算法基于面向对象思想的模块设计及基于Java的实现技术,详细说明了有界搜索树与动态规划的具体实现技术,对复杂参数算法从纯理论研究走向实际应用作了探索性的研究。

关 键 词:参数算法  面向对象思想  动态规划  实现技术  可重构阵列  生物化学  工业制造  Java  模块设计  理论研究  搜索树  代表性  探索性  应用  有界

Study of Implementation about Parameterized Algorithm
ZHANG Zu-ping,ZHOU Miao-Miao,CHEN Jian-er.Study of Implementation about Parameterized Algorithm[J].Computer Science,2005,32(7):228-230.
Authors:ZHANG Zu-ping  ZHOU Miao-Miao  CHEN Jian-er
Affiliation:ZHANG Zu-Ping,ZHOU Miao-Miao,CHEN Jian-Er School of Information Science & Engineering,Central South University,Changsha 410083
Abstract:Parameterized algorithm is widely applied in many fields such as industrial manufacture, biochemistry and so on. Bounded search tree and dynamic programming are frequently-used techniques in parameterized algorithm. Taking a typical parameterized algorithm about fault coverage in reconfigurable arrays as example, this paper de- scribes the modules design based on Object Oriented techniques and its Java-based implementary techniques. It also explains in detail the implementation of bounded search tree and dynamic programming. It is an exploratory develop- ment for complicated parameterized algorithm from pure theoretical research to practical application.
Keywords:Parameterized algorithm  Bounded search tree  Dynamic programming  Vertex coverage
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机科学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号