Benefits of Using a Population in Combinatorial Search

Add to your list(s) Download to your calendar using vCal

• Adam Prugel-Bennett, University of Southampton
• Thursday 16 October 2014, 16:00-17:00
• Hills Building, Room 120.

If you have a question about this talk, please contact Mohammad Tayarani.

Host: Mohammad Tayarani, m.tayarani@cs.bham.ac.uk

I will discuss 5 mechanisms whereby a population-based search algorithm may have a significant advantage over a non-population based (hill-climbing) search algorithm. These mechanisms are illustrated through a number of simplified “toy problems”. I then describe recent work to use run-time analysis to obtain a better understanding of how these mechanisms work.

This talk is part of the Computer Science Departmental Series series.

This talk is included in these lists:

• Computer Science Departmental Series
• Computer Science Distinguished Seminars
• Hills Building, Room 120
• computer sience

Note that ex-directory lists are not shown.