图 书 馆
讲座15：动态规划，最长公共子序列Lecture 15: Dynamic Programming, Longest Common Subsequence |
|
| 课程网址: | http://videolectures.net/mit6046jf05_leiserson_lec15/ |
| 主讲教师: | Leiserson Charles E |
| 开课单位: | 麻省理工学院 |
| 开课时间: | 2009-02-10 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | "So, the topic today is dynamic programming. The term programming in the name of this term doesn't refer to computer programming. OK, programming is an old word that means any tabular method for accomplishing something. So, you'll hear about linear programming and dynamic programming. Either of those, even though we now incorporate those algorithms in computer programs, originally computer programming, you were given a datasheet and you put one line per line of code as a tabular method for giving the machine instructions as to what to do..." |
| 关 键 词: | 动态规划; 术语编程; 计算机程序设计; 线性规划 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2020-05-22：吴雨秋(课程编辑志愿者) |
| 阅读次数: | 38 |