• Medientyp: Sonstige Veröffentlichung; E-Artikel
  • Titel: Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 23351)
  • Beteiligte: Bilyk, Dmitriy [Verfasser:in]; Gnewuch, Michael [Verfasser:in]; Vybíral, Jan [Verfasser:in]; Yaroslavtseva, Larisa [Verfasser:in]; Harsha, Kumar [Verfasser:in]
  • Erschienen: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
  • Sprache: Englisch
  • DOI: https://doi.org/10.4230/DagRep.13.8.106
  • Schlagwörter: infinite-variate problems ; tractability analysis ; sampling ; quasi-{M}onte {C}arlo ; computational stochastics
  • Entstehung:
  • Anmerkungen: Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
  • Beschreibung: The Dagstuhl Seminar 23351 was held at the Leibniz Center for Informatics, Schloss Dagstuhl, from August 27 to September 1, 2023. This event was the 14th in a series of Dagstuhl Seminars, starting in 1991. During the seminar, researchers presented overview talks, recent research results, work in progress and open problems. The first section of this report describes the goal of the seminar, the main seminar topics, and the general structure of the seminar. The third section contains the abstracts of the talks given during the seminar and the forth section the problems presented at the problem session.
  • Zugangsstatus: Freier Zugang