<?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-20T05:48:10Z</responseDate>
  <request identifier="2116" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:2116</identifier>
        <datestamp>2024-03-06T11:08:44Z</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>09181 Executive Summary – Sampling-based Optimization in the Presence of Uncertainty</dc:title>
          <dc:creator>Branke, Jürgen</dc:creator>
          <dc:creator>Nelson, Barry L.</dc:creator>
          <dc:creator>Powell, Warren Buckler</dc:creator>
          <dc:creator>Santner, Thomas J.</dc:creator>
          <dc:subject>Optimal learning</dc:subject>
          <dc:subject>optimization in the presence of uncertainty</dc:subject>
          <dc:subject>simulation optimization</dc:subject>
          <dc:subject>sequential experimental design</dc:subject>
          <dc:subject>ranking and selection</dc:subject>
          <dc:subject>random search</dc:subject>
          <dc:subject>stochastic approximation</dc:subject>
          <dc:subject>approximate dynamic programming</dc:subject>
          <dc:description>This Dagstuhl seminar brought together researchers from statistical ranking and selection; experimental design and response-surface modeling; stochastic programming; approximate dynamic programming; optimal learning; and the design and analysis of computer experiments with the goal of attaining a much better mutual understanding of the commonalities and differences of the various approaches to sampling-based optimization, and to take first&#13;
steps toward an overarching theory, encompassing many of the topics above.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Jürgen Branke and Barry L. Nelson and Warren Buckler Powell and Thomas J. Santner</dc:contributor>
          <dc:date>2009</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 9181, Sampling-based Optimization in the Presence of Uncertainty (2009)</dc:relation>
          <dc:type>InProceedings</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/DagSemProc.09181.2</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-21161</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09181.2</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
