This course introduces techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics: Randomized algorithms, Divide-and-Conquer; Greedy method, Dynamic programming, Backtracking, Branch-and-bound; graph algorithms; NP-complete problems. The aim of this course is to have a more detailed study of efficient algorithms for computational problems. 2.教學大綱: 配合台灣師範大學演算法開課之課綱增修至少包含 Introduction Lower Bounds (Complexity) Greedy Method Divide-&-Conquer Strategy Searching Method (Branch-&-Bound Strategy) Prune-&-Search Strategy Dynamic Programming Strategy
通过条件
成 绩:60 分
-
undefined
-
undefined
-
undefined
-
undefined
-
undefined
-
undefined
-
undefined
-
undefined
-
undefined
- 课程介绍
- 课程安排
- 評論