Tobias Friedrich and Frank Neumann
| Time: | Monday 16:15. Start: April 14, 2008. | ||||||||||||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Room: | Building E1.4 (Max-Planck-Institut), Room 0.24 | ||||||||||||||||||||||||||||||||||||
| Registration: | Please subscribe electronically until Sunday, April 13. | ||||||||||||||||||||||||||||||||||||
| Content: |
Bio-inspired computation methods have widely been applied to complex engineering problems as well as to problems from combinatorial optimization. Heuristic approaches belonging to this kind of algorithms are ant colony optimization, estimation of distribution algorithms, or evolutionary algorithms.
The goal of these algorithms is to evolve a set of search point, called population, over time until a good solution for a given problem has been obtained. The mentioned approaches differ from each other in way how they produce the population of the next iteration. In this seminar, we want to discuss the different approaches and show where they can be successfully applied. Some talks should therefore deal with the different approaches in the area of bio-inspired computation in general. Later on, we consider successful applications for problems from combinatorial optimization, financial systems, or routing in networks. Afterwards, our goal is to examine how bio-inspired computation methods can be analyzed from a theoretical point of view. Here, one main point is to investigate such algorithms with respect to their runtime behavior. | ||||||||||||||||||||||||||||||||||||
| Remark: |
This seminar is not about bioinformatics.
Bio-inspired computation
deals with algorithms that use computational techniques inspired by nature while in
bioinformatics
one is interested in the management and analysis of actual biological data.
| ||||||||||||||||||||||||||||||||||||
| Audience: |
The course counts as a computer science seminar (7 CP).
The talks will be given in English. | ||||||||||||||||||||||||||||||||||||
| Schedule: |
| ||||||||||||||||||||||||||||||||||||
| Credit Points: | Given for successful talk (45 min) and written abstract (2 pages). | ||||||||||||||||||||||||||||||||||||
| References: | (for copyright reasons only visible to users on campus) |