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.
並配合台灣師範大學演算法開課之課綱增修至少包含
	Introduction
	Lower Bounds (Complexity)
	Greedy Method
	Divide-&-Conquer Strategy
	Searching Method (Branch-&-Bound Strategy)
	Prune-&-Search Strategy
	Dynamic Programming Strategy
	NP-Completeness
	Branch-&-Bound Strategy
 Pass condition
Grade:70 Fraction
  • undefined
  • undefined
  • undefined
  • undefined
  • undefined
  • undefined
  • undefined
  • undefined
  • undefined
  • undefined
Instructor
丁德榮
Recommended Courses
  • 1111-Artificial Intelligence-54019
    Period:2022-09-01~2023-02-24
    LINE sharing feature only supports mobile devices
  • 1091-Computer Algorithms-54020
    Period:2020-09-14~2021-01-18
    LINE sharing feature only supports mobile devices
  • 1072-Wavelength Division Multiplexing Network-54021
    Period:Not set
    LINE sharing feature only supports mobile devices
  • 1051-Topics in Network Communication I-54019
    Period:2016-08-01~2017-01-31
    LINE sharing feature only supports mobile devices
  • 1011-Seminar-54050
    Period:2012-09-10~2013-01-31
    LINE sharing feature only supports mobile devices


LINE sharing feature only supports mobile devices