03/04/24 - Mini-Workshop tomorrow, 9:00-17:00 in FSC 1613.
New Time and Location: Tue 11-13 and Fri 13-14 in CICSR/CS 163
Instructor: Holger Hoos
[Current official information on graduate courses in 2002/03 Term 2 can be found here]
If you always wondered how hard problems from many domains, including AI, Bioinformatics, and Electronic Commerce, are solved in practice, this course will introduce you thoroughly to at least one very popular and successful general approach.
And if you want to learn (more) about one of the hottest topics in AI, Operations Research, and Empirical Algorithmics research, you've found the right place!
The course will introduce many basic stochastic search methods and their most relevant variants, point out and discuss connections and differences between them, tell you implementation tricks and details which are hardly ever explained but essential to obtain good performance, and show you how these algorithms can be applied to many hard combinatorial problems from various domains, including AI, Operations Research, and Bioinformatics! The course will introduce you to the foundations of stochastic search and many of its very successful applications. It will provide you with a good balance of abstract and theoretical contents as well as with hands-on-experience (including implementation).
To date, designing stochastic search algorithms and applying them successfully to hard combinatorial problems is as much an art or a craft as it is a science. I will introduce you to both aspects of this exciting research area, and share many of my secrets with you ;-) There is no single book that offers the material covered by course (I am currently writing it, and will share drafts with you), and in many ways we will go beyond what you can easily find in the research literature.
Interested? Check out the in information in the following sections ...
|02/03||students submit short project proposal (a sample project proposal from last year can be found here)|
|03/03||students submit short progress report|
|03/31||students submit final report (a sample final project report from last year can be found here)|
04/25, 9:00-17:30: project presentations (Mini-Workshop), FSC 1613.
|02/04 - due 02/14||Assignment 1 (covers Modules 1-4)|
|03/10 - due 03/18||Assignment 2 (covers Modules 5-7)|
|04/18 - due 05/01||Assignment 3 (optional)
(integrates knowledge from the entire course)
Required reading: Holte, R.C. Combinatorial Auctions, Knapsack Problems, and Hill-climbing Search.
Proc. AI'2001, Lecture Notes in Artificial Intelligence 2056, pp. 57-66, Springer Verlag, 2001.