This course is the third course in the "Three concepts" series, and serves as an introduction to search methods in high-dimensional spaces typical to data modeling and optimization of complex systems. The main focus is in the use of stochastic search algorithms, or metaheuristics, such as randomized greedy, simulated annealing and genetic algorithms for solving optimization problems typical of complex artificial systems, such as telecommunication networks, logistics or decision support systems. In addition to providing some theoretical background, the course's emphasis is in problem solving.
Anyone interested in topics such as intelligent agents, learning, data mining, or artificial intelligence is welcome. This course is intended to give you ideas and teach new tools to solve problems. The course is aimed at graduate and senior undergraduate students.
Note that the maximum number of participants is 25. See here for more information.
The course is an introductory course, and only elementary knowledge in probability theory is required. Different parts of the course, however, have different requirements with respect to the mathematical machinery needed to apply the concepts in question. Typically some analysis and very elementary mathematical statistics are required. The course will be based on programming projects, thus good programming skills are necessary.
The course work involves light weekly assignments (third period only), three programming projects, poster presentation and a term paper.
The assignments prepare students for project work which is done in groups of two or three students. Because the problem-oriented nature of the course, the weekly meetings involve discussion on various optimization and search techniques, and the student presentations on their application of these techniques to various problems, rather than traditional lecturing.
During the first week of classes anybody can drop out by just sending email to the instructor. The project work, which is done in groups, starts immediately, and the students are expected to be committed to the course from the very beginning. Also at this point the vacant slots will be filled from the pool of students in the waiting list.
|
|
|
|
|
|
| Three Concepts: Utility | |