Evolutionary Computing
The course is not on the list Without time-table
| Code | Completion | Credits | Range | Language |
|---|---|---|---|---|
| XP33ECD | ZK | 4 | 2P+1S | Czech |
- Garant předmětu:
- Lecturer:
- Tutor:
- Supervisor:
- Department of Cybernetics
- Synopsis:
-
Introduction to evolutionary computing in contrast to classical computing
techniques, Genetic algorithms (GA) for optimisation. The Simple Genetic
Algorithm (SGA) and its behaviour. GA Convergence, negative phenomena. GA
and constrained tasks, special representations. Genetic Programming (GP),
relationship to GA. GP typical tasks, GP and machine learning. GA and GP
applications. Special methods for improving GA performance.
- Requirements:
- Syllabus of lectures:
- Syllabus of tutorials:
- Study Objective:
- Study materials:
-
Michalewicz, Zbigniew: Genetic Algorithms + Data Structures = Evolution
Programs, Springer-Verlag, 1992
- Note:
- Further information:
- No time-table has been prepared for this course
- The course is a part of the following study plans:
-
- Doctoral studies, daily studies (compulsory elective course)
- Doctoral studies, combined studies (compulsory elective course)
- Doctoral studies, structured daily studies (compulsory elective course)
- Doctoral studies, structured combined studies (compulsory elective course)