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

Dear colleagues,

Applications are invited for a 3-year Research Fellowship (postdoc) in
the theory of co-evolutionary computation at the University of
Birmingham. Co-evolutionary algorithms are heuristic optimisation
techniques, mimicking biological principles of natural selection, e.g.
for minimax/robust optimisation and learning game playing strategies.
Such algorithms have been successfully applied to various industrial
optimisation domains. However, the theoretical understanding of these
methods has been limited.

The successful candidate will contribute, together with other project
team members and international academic and industrial partners, towards
developing the theoretical foundation necessary for the design of
efficient and reliable co-evolutionary algorithms. The fellowship is
funded by the UKRI Turing AI Acceleration Fellowship project "Rigorous
Time-Complexity Analysis of co-Evolutionary Algorithms", providing
generous travel allowance, computing facilities etc.

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/CIZ598/research-fellow-in-theory-of-co-evolutionary-computation

The closing date is 13 Oct 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/
*
**********************************************************