1 / 5

CSI6557-01 진화연산

This course provides an introduction to evolutionary computation, covering genetic algorithms, theoretical foundations, implementation, and applications. Evaluation criteria include term projects, written exams, and homework assignments.

smead
Download Presentation

CSI6557-01 진화연산

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. CSI6557-01진화연산 2008년도 제 1학기

  2. 강의진 소개 • 담당 교수 • 조성배(공대 C515;  2123-2720; sbcho@cs.yonsei.ac.kr) • 담당 조교 • 황금성(yellowg@sclab.yonsei.ac.kr) • 웹 페이지 : http://sclab.yonsei.ac.kr/Courses/08EC • 강의 시간 : 화6, 목6, 7 • 강의 장소 : A623 • 면담 시간 : 화7, 8

  3. 수업 교재 • Textbook • M. Mitchell, An Introduction to Genetic Algorithms, MIT Press, 1996 • L. Fogel, Artificial Intelligence through Simulated Evolution, John Wiley & Sons, 1966 • T. Back, D.B. Fogel and T. Michalewicz, Evolutionary Computation 1 & 2, IOP Publishing Co, 2000 • D.E. Goldberg, Genetic Algorithms in Search, Optimization & Machine Learning, Addison Wesley, 1989 • D.B. Fogel, Evolutionary Computation, IEEE Press, 1995 • 문병로, 유전알고리즘, 다성출판사, 2001 • 조성배, 유전자 알고리즘, 대청출판사, 1996 • Related Conference Proceedings (CEC, GECCO, etc)

  4. Evaluation Criteria • Evaluation Criteria • Term Project (written report and an oral presentation) : 50% • Written Exam : 20% • Homework : 30% • Term Project (Oral presentation is required) : • Theoretical Issue (Analysis, Experiment, Simulation) : Originality • Interesting Programming (Game, Demo, etc) : Performance • Survey : Completeness

  5. Course Schedule 1. An overview of EC 2. Genetic Algorithms: An Overview (M, chap 1) 3. Genetic Algorithms in Problem Solving (M, chap 2) 4. Genetic Algorithms in Scientific Models (M, chap 3) 5. Theoretical Foundations of Genetic Algorithms (M, chap 4) 6. Implementing a Genetic Algorithm (M, chap 5) 7. Co-evolution, Niching and speciation, Fitness sharing 8. 4/21 ~ 26 : Mid-term exam 9. Hybrid evolutionary systems (1) 10. Hybrid evolutionary systems (2) 11. Application 1 (Evolutionary games) 12. Application 2 (Evolutionary robotics) 13. Application 3 (Evolutionary agents) 14. Application 4 (Evolutionary multimedia) 15. Term project presentation 16. 6/16~21 : Final exam

More Related