<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-26T16:44:50Z</responseDate>
  <request identifier="4260" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:4260</identifier>
        <datestamp>2024-03-06T10:26:02Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Theory of Evolutionary Algorithms (Dagstuhl Seminar 13271)</dc:title>
          <dc:creator>Doerr, Benjamin</dc:creator>
          <dc:creator>Hansen, Nikolaus</dc:creator>
          <dc:creator>Shapiro, Jonathan L.</dc:creator>
          <dc:creator>Whitley, L. Darrell</dc:creator>
          <dc:subject>evolutionary algorithms</dc:subject>
          <dc:subject>optimization</dc:subject>
          <dc:subject>search heuristics</dc:subject>
          <dc:subject>algorithms</dc:subject>
          <dc:subject>artificial intelligence</dc:subject>
          <dc:description>This report documents the talks and discussions of Dagstuhl Seminar 13271 "Theory of Evolutionary Algorithms". This seminar, now in its 7th edition, is the main meeting point of the highly active theory of randomized search heuristics subcommunities in Australia, Asia, North America and Europe. Topics intensively discussed include a complexity theory for randomized search heuristics, evolutionary computation in noisy settings, the drift analysis technique, and parallel evolutionary computation.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Benjamin Doerr and Nikolaus Hansen and Jonathan L. Shapiro and L. Darrell Whitley</dc:contributor>
          <dc:date>2013</dc:date>
          <dc:relation>Is Part Of Dagstuhl Reports, Volume 3, Issue 7 (2013)</dc:relation>
          <dc:type>Article</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/DagRep.3.7.1</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-42603</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagRep.3.7.1</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/3.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
