CRNSFerrante Neri2013
Update: 2013-10-18
Description
title: Towards Automatic Design of Optimisation Algorithms
abstract: Memetic Computing (MC) is a subject that studies optimization algorithms as structured collections of interacting operators. This talk introduces MC, explains sequential and parallel memetic structures, states the Ockham's Razor principle in MC and shows how a bottom-up approach, in accordance to the No Free Lunch Theorem, can lead to simple and yet efficient algorithmic structures. [(CC) BY-NC-SA 2.0 UK]
abstract: Memetic Computing (MC) is a subject that studies optimization algorithms as structured collections of interacting operators. This talk introduces MC, explains sequential and parallel memetic structures, states the Ockham's Razor principle in MC and shows how a bottom-up approach, in accordance to the No Free Lunch Theorem, can lead to simple and yet efficient algorithmic structures. [(CC) BY-NC-SA 2.0 UK]
Comments
In Channel
Download from Google Play
Download from App Store
United States00:00
00:00
x
