3 Search Results for "Doerr, Carola"

Document
DOI: 10.4230/DagRep.9.10.61
Theory of Randomized Optimization Heuristics (Dagstuhl Reports 19431)

Authors: Carola Doerr, Carlos M. Fonseca, Tobias Friedrich, and Xin Yao

Published in: Dagstuhl Reports, Volume 9, Issue 10 (2020)

Abstract
This report documents the activities of Dagstuhl Seminar 19431 on Theory of Randomized Optimization Heuristics. 46 researchers from Europe, Australia, Asia, and North America have come together to discuss ongoing research. This tenth edition of the seminar series had three focus topics: (1) relation between optimal control and heuristic optimization, (2) benchmarking optimization heuristics, and (3) the interfaces between continuous and discrete optimization. Several breakout sessions have provided ample opportunity to brainstorm on recent developments in the research landscape, to discuss and solve open problems, and to kick-start new research initiatives.
Cite as

Carola Doerr, Carlos M. Fonseca, Tobias Friedrich, and Xin Yao. Theory of Randomized Optimization Heuristics (Dagstuhl Reports 19431). In Dagstuhl Reports, Volume 9, Issue 10, pp. 61-94, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

Copy BibTex To Clipboard

@Article{doerr_et_al:DagRep.9.10.61,
  author =	{Doerr, Carola and Fonseca, Carlos M. and Friedrich, Tobias and Yao, Xin},
  title =	{{Theory of Randomized Optimization Heuristics (Dagstuhl Reports 19431)}},
  pages =	{61--94},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2020},
  volume =	{9},
  number =	{10},
  editor =	{Doerr, Carola and Fonseca, Carlos M. and Friedrich, Tobias and Yao, Xin},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.9.10.61},
  URN =		{urn:nbn:de:0030-drops-118567},
  doi =		{10.4230/DagRep.9.10.61},
  annote =	{Keywords: algorithms and complexity, evolutionary algorithms, machine learning, optimization, soft computing}
}
Document
DOI: 10.4230/DagRep.7.5.22
Theory of Randomized Optimization Heuristics (Dagstuhl Seminar 17191)

Authors: Carola Doerr, Christian Igel, Lothar Thiele, and Xin Yao

Published in: Dagstuhl Reports, Volume 7, Issue 5 (2018)

Abstract
This report summarizes the talks, breakout sessions, and discussions at the Dagstuhl Seminar 17191 on "Theory of Randomized Optimization Heuristics", held during the week from May 08 until May 12, 2017, in Schloss Dagstuhl -- Leibniz Center for Informatics. The meeting is the successor of the "Theory of Evolutionary Algorithm" seminar series, where the change in the title reflects the development of the research field toward a broader range of heuristics. The seminar has hosted 40 researchers from 15 countries. Topics that have been intensively discussed at the seminar include population-based heuristics, constrained optimization, non-static parameter choices as well as connections to research in machine learning.
Cite as

Carola Doerr, Christian Igel, Lothar Thiele, and Xin Yao. Theory of Randomized Optimization Heuristics (Dagstuhl Seminar 17191). In Dagstuhl Reports, Volume 7, Issue 5, pp. 22-55, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)

Copy BibTex To Clipboard

@Article{doerr_et_al:DagRep.7.5.22,
  author =	{Doerr, Carola and Igel, Christian and Thiele, Lothar and Yao, Xin},
  title =	{{Theory of Randomized Optimization Heuristics (Dagstuhl Seminar 17191)}},
  pages =	{22--55},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2017},
  volume =	{7},
  number =	{5},
  editor =	{Doerr, Carola and Igel, Christian and Thiele, Lothar and Yao, Xin},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.7.5.22},
  URN =		{urn:nbn:de:0030-drops-82797},
  doi =		{10.4230/DagRep.7.5.22},
  annote =	{Keywords: algorithms and complexity, evolutionary algorithms, machine learning, optimization, soft computing}
}
Document
DOI: 10.4230/LIPIcs.STACS.2012.441
Playing Mastermind With Constant-Size Memory

Authors: Benjamin Doerr and Carola Winzen

Published in: LIPIcs, Volume 14, 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)

Abstract
We analyze the classic board game of Mastermind with n holes and a constant number of colors. The classic result of Chvatal (Combinatorica 3 (1983), 325-329) states that the codebreaker can find the secret code with Theta(n / log n) questions. We show that this bound remains valid if the codebreaker may only store a constant number of guesses and answers. In addition to an intrinsic interest in this question, our result also disproves a conjecture of Droste, Jansen, and Wegener (Theory of Computing Systems 39 (2006), 525-544) on the memory-restricted black-box complexity of the OneMax function class.
Cite as

Benjamin Doerr and Carola Winzen. Playing Mastermind With Constant-Size Memory. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 441-452, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)

Copy BibTex To Clipboard

@InProceedings{doerr_et_al:LIPIcs.STACS.2012.441,
  author =	{Doerr, Benjamin and Winzen, Carola},
  title =	{{Playing Mastermind With Constant-Size Memory}},
  booktitle =	{29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)},
  pages =	{441--452},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-35-4},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{14},
  editor =	{D\"{u}rr, Christoph and Wilke, Thomas},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2012.441},
  URN =		{urn:nbn:de:0030-drops-34112},
  doi =		{10.4230/LIPIcs.STACS.2012.441},
  annote =	{Keywords: Algorithms, Mastermind, black-box complexity, memory-restricted algorithms, query complexity}
}
  • Refine by Author
  • 2 Doerr, Carola
  • 2 Yao, Xin
  • 1 Doerr, Benjamin
  • 1 Fonseca, Carlos M.
  • 1 Friedrich, Tobias
  • Show More...

  • Refine by Classification

  • Refine by Keyword
  • 2 algorithms and complexity
  • 2 evolutionary algorithms
  • 2 machine learning
  • 2 optimization
  • 2 soft computing
  • Show More...

  • Refine by Type
  • 3 document

  • Refine by Publication Year
  • 1 2012
  • 1 2017
  • 1 2020

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact