<html><head>
<meta http-equiv="Content-Type" content="text/html; charset=Windows-1252">
  </head>
  <body>
    <p>-------- Forwarded Message --------</p>
    <div class="moz-forward-container">
      <table class="moz-email-headers-table" cellspacing="0" cellpadding="0" border="0">
        <tbody>
          <tr>
            <th valign="BASELINE" nowrap="nowrap" align="RIGHT">Subject:
            </th>
            <td>[DMANET] Postdoc opening: &quot;Time-Complexity Analysis of
              co-Evolutionary Algorithms&quot;</td>
          </tr>
          <tr>
            <th valign="BASELINE" nowrap="nowrap" align="RIGHT">Date: </th>
            <td>Tue, 14 Sep 2021 23:23:22 +0100</td>
          </tr>
          <tr>
            <th valign="BASELINE" nowrap="nowrap" align="RIGHT">From: </th>
            <td>Per Kristian Lehre <a class="moz-txt-link-rfc2396E" href="mailto:p.k.lehre@cs.bham.ac.uk">&lt;p.k.lehre@cs.bham.ac.uk&gt;</a></td>
          </tr>
          <tr>
            <th valign="BASELINE" nowrap="nowrap" align="RIGHT">To: </th>
            <td><a class="moz-txt-link-abbreviated" href="mailto:dmanet@zpr.uni-koeln.de">dmanet@zpr.uni-koeln.de</a></td>
          </tr>
        </tbody>
      </table>
      <br>
      Dear colleagues,<br>
      <br>
      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.<br>
      <br>
      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 &quot;Rigorous Time-Complexity Analysis
      of co-Evolutionary Algorithms&quot;, providing generous travel
      allowance, computing facilities etc.<br>
      <br>
      The ideal candidate will have a strong research track record in
      theory of evolutionary computation, algorithmic game theory,
      and/or randomised algorithms.<br>
      <br>
      For further details, please see<br>
      <br>
<a class="moz-txt-link-freetext" href="https://www.jobs.ac.uk/job/CIZ598/research-fellow-in-theory-of-co-evolutionary-computation">https://www.jobs.ac.uk/job/CIZ598/research-fellow-in-theory-of-co-evolutionary-computation</a>&gt;<br>
      The closing date is 13 Oct 2021.<br>
      <br>
      Best wishes,<br>
      <pre class="moz-signature">-- 
Dr Per Kristian Lehre
Senior Lecturer in School of Computer Science
University of Birmingham, UK
<a class="moz-txt-link-freetext" href="http://www.cs.bham.ac.uk/~lehrepk">http://www.cs.bham.ac.uk/~lehrepk</a>&gt;@pklehre on Twitter

</pre>
    </div>
  </body>
</html>