首页 | 本学科首页   官方微博 | 高级检索  
     检索      

从动态规划算法的应用谈算法设计的教学
引用本文:万润泽,朱彦松.从动态规划算法的应用谈算法设计的教学[J].湖北第二师范学院学报,2012(8):124-126.
作者姓名:万润泽  朱彦松
作者单位:湖北第二师范学院计算机学院;中原工学院计算机学院
基金项目:湖北省教育厅项目(B20113007);武汉市高校中青年教师项目(B2010033)
摘    要:动态规划是一种用于求解包含重叠子问题的最优化问题的方法。其基本思想是,将问题分解为相似的子问题,通过子问题的解组合求出原问题的解。动态规划的思想是多种算法的基础,被广泛应用于计算机科学和工程领域。本文通过阐述动态规划算法的求解过程、应用举例,结合教学体会分析了算法设计课程的教学方法。

关 键 词:算法设计  动态规划  教学研究

On Teaching of Algorithm Design from the Application of Dynamic Programming Algorithm
WAN Run-ze,ZHU Yan-song.On Teaching of Algorithm Design from the Application of Dynamic Programming Algorithm[J].Journal of Hubei University of Education,2012(8):124-126.
Authors:WAN Run-ze  ZHU Yan-song
Institution:1.School of Computer Science,Hubei University of Education,Wuhan 430205,China; 2.College of Computer,Zhongyuan University of Technology,Zhengzhou 450007,China)
Abstract:Dynamic programming is a kind of method,which is used for solving overlapping sub-problems.The basic idea is devided into a series of similar problems,and the solution of these sub-problems is combinated so as to obtain the solution of the original problem.Many algorithms are based on the idea of dynamic programming algorithms,which is widely applied in the field of computer science and engineering.This paper discusses the solving process,the examples of the application,and analyses teaching methods of the course.
Keywords:algorithm design  dynamic programming  teaching and research
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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