General information

Course name	Exercises: Suchalgorithmen (Search Algorithms) Ü (R 5.08)
Semester	WS 2018/19
Current number of participants	4
Home institute	Leitung des Instituts für Informatik
participating institutes	Institut für Informatik
Courses type	Exercises in category Offizielle Lehrveranstaltungen
First date	Tuesday, 06.11.2018 14:15 - 15:45

Lehrende

Prof. Dr. Matthias Hagen

Tutor/-in

Janek Bevendorff, M. Sc

Rooms and times

No room preference: Tuesday: 12:00 - 13:30, weekly

Fields of study

Naturwissenschaftliche Fakultät III - Agrarwiss., Geowiss. und Informatik > Informatik > Institut für Informatik > Themen > Lehrgebiet Datenbanken und Informationssysteme

Module assignments

Informatik InformatikMA120, Akkreditierungsfassung (WS 2016/17 - WS 2022/23) > Alle Module aus den Vertiefungsrichtungen und zusätzlich: > INF.01088.05 - Gast-Modul A, valid from WS 2006/07 > LV 2: Kursus (Selbststudium)
Bioinformatik BioinformatikMA120, Akkreditierungsfassung valid from SoSe 2023 > Algorithmen und Theoretische Informatik (Anteil gem. § 5 Abs. 4-6, Anlage 2) > INF.01088.05 - Gast-Modul A, valid from WS 2006/07 > LV 2: Kursus (Selbststudium)
Informatik InformatikMA120, Akkreditierungsfassung (WS 2013/14 - SS 2016) > Alle Module aus den Vertiefungsrichtungen und zusätzlich: > INF.01088.05 - Gast-Modul A, valid from WS 2006/07 > LV 2: Kursus (Selbststudium)
Informatik InformatikMA120, Akkreditierungsfassung (WS 2006/07 - SS 2013) > Wahlbereich > INF.01088.05 - Gast-Modul A, valid from WS 2006/07 > LV 2: Kursus (Selbststudium)

Comment/Description

The course will introduce search algorithms as a means to solve combinatorial problems such as constraint satisfaction and optimization problems. Tackling such problems by a machine often follows a two-step approach: (1) definition of a space of solution candidates plus (2) intelligent exploration of this space. The students will learn to analyze the nature of search problems, this way being able to devise adequate search space representations. We will cover the modeling of search problems, basic (uninformed) search algorithms, informed search algorithms, as well as hybrid combinations. A special focus will be put on heuristic search approaches. The lecture introduces concepts, algorithms, and theoretical backgrounds.