Lehrveranstaltungen im WS 2007/2008 /
Bachelor-Seminar Künstliche Intelligenz:
-
Einführung.
- Kapitel 1/2 in Russell/Norvig
-
A* als Beispiel für heuristische Suche.
Vortragender: Sascha El-Sharkawy
- Kapitel 3/4 in Russell/Norvig
-
Das Erfüllbarkeitsproblem der Aussagenlogik.
Vortragende: Katherina Meißner
- Kapitel 7 in Russell/Norvig
- [ee] Niklas Eén, Niklas Sörensson (2003): An Extensible SAT-solver In Enrico Giunchiglia and Armando Tacchella (eds.): Theory and Applications of Satisfiability Testing, 6th International Conference, SAT 2003. Santa Margherita Ligure, Italy, May 5-8, 2003 Selected Revised Papers , Springer, pp. 502-518.
-
Automatisiertes Planen.
Vortragender: Kiotes Konstantinos
- Abschnitt 2.3 und Kapitel 11 in Russell/Norvig
- [ee] Avrim Blum, Merrick L. Furst (1997): Fast Planning Through Planning Graph Analysis. Artif. Intell. 90/1-2, pp. 281-300.
- [ee] Henry A. Kautz, David A. McAllester, Bart Selman (1996): Encoding Plans in Propositional Logic. KR, pp. 374-384.
- [ee] Henry A. Kautz (2006): Deconstructing Planning as Satisfiability. In none (eds.): Proceedings, The Twenty-First National Conference on Artificial Intelligence and the Eighteenth Innovative Applications of Artificial Intelligence Conference , AAAI Press, Boston, MA, USA.
Weiteres (optional): -
Binäre und nicht-binäre Constraint-Netzwerke.
Vortragender: Marcel Thum
- [ee] Fahiem Bacchus, Peter van Beek (1998): On the Conversion between Non-Binary and Binary Constraint Satisfaction Problems. AAAI/IAAI, pp. 310-318.
-
Qualitatives zeitliches Schließen.
Vortragender: Paul Dürre
- [ee] Peter van Beek, Dennis W. Manchak (1996): The Design and an Experimental Analysis of Algorithms for Temporal Reasoning Journal of Artificial Intelligence Research 4, pp. 1-18.
-
Einführung in die Entscheidungs- und Utility-Theorie.
Vortragender: Konrad Nerger
- Kapitel 16 in Russell/Norvig
-
Entscheidungen in unsicheren Umgebungen.
Vortragender: Andreas Wilkes
- Kapitel 17 in Russell/Norvig
-
Strategische Spiele: Finden von Nash-Gleichgewichten mit numerischen Verfahren.
Vortragender: Stefan Schrieck
Bernhard Nebel Spieltheorie .Vorlesung an der Universität Freiburg 2005 [ee]- Dimitris Bertsimas, John N. Tsitsiklis (1997): Introduction to Linear Optimization .
- [ee] Vincent Conitzer, Tuomas Sandholm (2003): Complexity results about Nash equilibria Eighteenth International Joint Conference on Artificial Intelligence, Acapulco, Mexico, pp. 765-771.
Weiteres (optional): - Extensive Spiele: Minimax und Computer-Go. Vortragender: Malte Klemke
-
Textklassifikation mit Naive-Bayes.
Vortragender: Fabian Raschke
- [ee] Mehran Sahami, Susan Dumais, David Heckerman, Eric Horvitz (1998): A Bayesian Approach to Filtering Junk E-Mail Learning for Text Categorization: Papers from the 1998 Workshop, AAAI Technical Report WS-98-05, Madison, Wisconsin.
- [ee] Patrick Pantel, Dekang Lin (1998): SpamCop: A Spam Classification & Organization Program Learning for Text Categorization: Papers from the 1998 Workshop, AAAI Technical Report WS-98-05, Madison, Wisconsin.
-
Named Entity Recognition.
Vortragende: Philine Brinkmann
- [ee] Bernardo Magnini, Matteo Negri, Roberto Prevete, Hristo Tanev (2002): A WordNet-based approach to Named Entities recognition COLING-02 on SEMANET, Association for Computational Linguistics, Morristown, NJ, USA, pp. 1-7.
- Roboter-Steuerung mit Hilfe von Reinforcement Learning. Vortragender: Sebastian Schniedermeyer
-
Klassifikation von Orten für einen mobilen Roboter.
Vortragende: Özlem Can
- [ee] O. Martínez Mozos, C. Stachniss, W. Burgard (2005): Supervised Learning of Places from Range Data using AdaBoost Proc. of the IEEE Int. Conf. on Robotics & Automation (ICRA), Barcelona, Spain, pp. 1742-1747.