演算法設計及分析
出自中山電機所 無線行動網路實驗室
(修訂版本間差異)
(→研究所課程, 2011 Spring, Tue 9:00~12:00 AM, F3009) |
|||
第3行: | 第3行: | ||
[http://140.117.157.64/enter/images/c/c6/Lecture_1_Introduction.pdf Chapter 1. Introduction](2011/02/21) | [http://140.117.157.64/enter/images/c/c6/Lecture_1_Introduction.pdf Chapter 1. Introduction](2011/02/21) | ||
- | [http://140.117.157.64/enter/images/d/d2/Lecture_2_Growth_of_Functions.pdf Chapter 2. Growth of Functions] | + | [http://140.117.157.64/enter/images/d/d2/Lecture_2_Growth_of_Functions.pdf Chapter 2. Growth of Functions](更新。2011/03/08) |
+ | |||
+ | Chapter 3. Divide and Conquer(2011/03/08) | ||
+ | |||
+ | Chapter 4. Selection(2011/03/08) | ||
+ | |||
+ | Chapter 5. Randomized Algorithms(2011/03/08) | ||
+ | |||
+ | Chapter 6. Dynamic Programming(2011/03/08) | ||
+ | |||
+ | Chapter 7. Greedy Algorithm(2011/03/08) | ||
+ | |||
+ | Chapter 8. Strongly Connected Components(2011/03/08) | ||
+ | |||
+ | Chapter 9. Minimum Cost Spanning Tree(選擇性教材) | ||
+ | |||
+ | Chapter 10. Maximum Flow(2011/03/08) | ||
+ | |||
+ | Chapter 11. Linear Programming(2011/03/08) | ||
+ | |||
+ | Chapter 12. NP-Completeness(2011/03/08) | ||
+ | |||
+ | Chapter 13. Approximation Algorithms(2011/03/08) | ||
+ | |||
+ | Chapter 14. Genetic Algorithms(選擇性教材) |
在2011年3月8日 (二) 08:19所做的修訂版本
研究所課程, 2011 Spring, Tue 9:00~12:00 AM, F3009
Chapter 1. Introduction(2011/02/21)
Chapter 2. Growth of Functions(更新。2011/03/08)
Chapter 3. Divide and Conquer(2011/03/08)
Chapter 4. Selection(2011/03/08)
Chapter 5. Randomized Algorithms(2011/03/08)
Chapter 6. Dynamic Programming(2011/03/08)
Chapter 7. Greedy Algorithm(2011/03/08)
Chapter 8. Strongly Connected Components(2011/03/08)
Chapter 9. Minimum Cost Spanning Tree(選擇性教材)
Chapter 10. Maximum Flow(2011/03/08)
Chapter 11. Linear Programming(2011/03/08)
Chapter 12. NP-Completeness(2011/03/08)
Chapter 13. Approximation Algorithms(2011/03/08)
Chapter 14. Genetic Algorithms(選擇性教材)