[DMANET] Postdoc opening: "Time-Complexity Analysis of co-Evolutionary Algorithms"

Dear colleagues,

We welcome applications for a Research Fellow (postdoc) in the theory of
evolutionary computation to work with Dr Per Kristian Lehre on the UKRI
Turing AI Fellowship funded project "Rigorous Time-Complexity Analysis
of co-Evolutionary Algorithms". Co-evolutionary algorithms are heuristic
optimisation techniques, mimicking biological principles of natural
selection, e.g. for minmax/robust optimisation and learning game playing
strategies.

The successful candidate will contribute, together with another 3 year
postdoc, 2 PhD students, and international academic and industrial
partners, towards developing the theoretical foundation necessary for
the design of efficient and reliable co-evolutionary algorithms.

The ideal candidate will have a strong research track record in theory
of evolutionary computation, algorithmic game theory, and/or randomised
algorithms.

For further details, please see
https://www.jobs.ac.uk/job/CFK453/research-fellow-in-theory-of-co-evolutionary-computation

The closing date is 20 May 2021.

Best wishes,
--
Dr Per Kristian Lehre
Senior Lecturer in School of Computer Science
University of Birmingham, UK
http://www.cs.bham.ac.uk/~lehrepk
@pklehre on Twitter
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************