CSCI 5240 基於限制的組合搜索與優化 Comb Search & Opt W/ Constrain

Course Code	CSCI 5240 CSCI5240			科目名稱		Comb Search & Opt W/ Constrain 基於限制的組合搜索與優化
教員	Professor LEE Ho Man [官方介紹] [學術著作]			學　　分		3
課程性質	PG – Taught			同科其他選擇
Workload	l   非PAPER類HOMEWORK l   FINAL EXAM								好重
									重
									平均	1
									輕
									極輕
評價教學內容	#1教學方法十分有趣, 每個星期需要自己網上睇片同做assignment, 但隔個星期先會上堂, 冇tutorial. 如果你進度快嘅話可以預先睇同做定之後嘅assignment. 而網上嘅片都整得好有心機, 有動畫有故事, 唔會悶
評價教員教學	#1會將啲concept 講得好清楚. 佢會經常問問題, 雖然會有啲壓力, 但真係會學到野
CUSIS科目資料	Description： Students will be exposed to various constraint-based combinatorial search and optimization techniques that arise in artificial intelligence, operations research, etc. Topics include, but are not limited to, local propagation, consistency algorithms, Boolean constraint solving, numerical constraint solving, linear programming, search, and their applications. Learning Outcome： At the end of the course of studies, students will have acquired the ability to 1.understand of Constraint Satisfaction Problems (CSPs). 2.formulate a real-life problem into a CSP. 3.understand of various constraint solving techniques for CSPs in a particular domain. 4.understand of the tree-search techniques for solving general CSPs. 5.understand of the various local consistency notions and their associated enforcement algorithms. 6.understand of how local consistency algorithms can be combined with tree search. 7.understand of stochastic local search algorithms. 8.make use of existing constraint solving tools to solve CSPs.
其他資料	2018Sem1：學位 30
同學推薦	高度推薦	1	推薦			有保留		極有保留