![]() |
![]() |
University of Birmingham > Talks@bham > Artificial Intelligence and Natural Computation seminars > Hitting times of local and global optima in genetic algorithms with very high selection pressure
Hitting times of local and global optima in genetic algorithms with very high selection pressureAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Hector Basevi. Host: Dr Per Kristian Lehre Speaker’s website: http://iitam.omsk.net.ru/~eremeev/index_e.htm Abstract: The talk is devoted to upper bounds on the expected first hitting times of the sets of local or global optima for non-elitist genetic algorithms with very high selection pressure. The results extend the range of situations where the upper bounds on the expected runtime are known for genetic algorithms and apply, in particular, to the Canonical Genetic Algorithm. The obtained bounds do not require the probability of fitness-decreasing mutation to be bounded by a constant which is less than one. This talk is part of the Artificial Intelligence and Natural Computation seminars series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsPostgraduate Algebra Seminar Nuclear physics seminars IRLab Seminars: Robotics, Computer Vision & AIOther talksLife : it’s out there, but what and why ? TBA TBA Hunt for an Earth-twin Quantum Sensing in Space Wave turbulence in the Schrödinger-Helmholtz equation |