Nach positiver Absolvierung der Lehrveranstaltung sind Studierende in der Lage...
After successful completion of the course, students are able to:
- Develop and apply uninformed and informed search methods
- Design and implement (meta)heuristic methods for various problems
- Model problems with constrsint programming (CP) modeling languages and SAT
- Use CP/SAT for solving various problems
- Understand concepts regarding tree/hypertree decompositions and be able to use (hyper)tree decompositions in problem solving
- Explain methods that are used for automated algorithm configuration and algorithm selection
- Apply automated algorithm selection and configuration for various problems/algorithms
The preliminary discussion will take place on 12.03.2021 (10:15 - 11:00) (Online). Lecture will take place online every Friday from 10:15-12:00.
ECTS Breakdown:
9 classes (including preparation): 25 h
project (including presentation): 25 h
exam: 25 h
---------------
total: 75 h
For latest information, please visit TUWEL
Z. Michalewicz and D. B. Fogel. How to Solve It: Modern Heuristics, 2nd edition, Springer-Verlag, 2004
Artificial Intelligence: A Modern Approach (Third Edition) by Stuart Russell and Peter Norvig; Prentice Hall, 2010.
Different scientific papers
Slides: TUWEL