Остановите войну!
for scientists:
default search action
Carsten Witt
- > Home > Persons > Carsten Witt
Publications
- 2024
- [j47]Benjamin Doerr, Amirhossein Rajabi, Carsten Witt:
Simulated Annealing is a Polynomial-Time Approximation Scheme for the Minimum Spanning Tree Problem. Algorithmica 86(1): 64-89 (2024) - 2023
- [c73]Benjamin Doerr, Taha El Ghazi El Houssaini, Amirhossein Rajabi, Carsten Witt:
How Well Does the Metropolis Algorithm Cope With Local Optima? GECCO 2023: 1000-1008 - [i37]Benjamin Doerr, Taha El Ghazi El Houssaini, Amirhossein Rajabi, Carsten Witt:
How Well Does the Metropolis Algorithm Cope With Local Optima? CoRR abs/2304.10848 (2023) - 2022
- [c72]Benjamin Doerr, Amirhossein Rajabi, Carsten Witt:
Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem. GECCO 2022: 1381-1389 - [i34]Benjamin Doerr, Amirhossein Rajabi, Carsten Witt:
Simulated Annealing is a Polynomial-Time Approximation Scheme for the Minimum Spanning Tree Problem. CoRR abs/2204.02097 (2022) - [i31]Josu Ceberio Uribe, Benjamin Doerr, Carsten Witt, Vicente P. Soloviev:
Estimation-of-Distribution Algorithms: Theory and Applications (Dagstuhl Seminar 22182). Dagstuhl Reports 12(5): 17-36 (2022) - 2021
- [j42]Benjamin Doerr, Carsten Witt, Jing Yang:
Runtime Analysis for Self-adaptive Mutation Rates. Algorithmica 83(4): 1012-1053 (2021) - 2019
- [j35]Benjamin Doerr, Christian Gießen, Carsten Witt, Jing Yang:
The (1+λ) Evolutionary Algorithm with Self-Adjusting Mutation Rate. Algorithmica 81(2): 593-631 (2019) - 2018
- [c55]Benjamin Doerr, Carsten Witt, Jing Yang:
Runtime analysis for self-adaptive mutation rates. GECCO 2018: 1475-1482 - [i20]Benjamin Doerr, Carsten Witt, Jing Yang:
Runtime Analysis for Self-adaptive Mutation Rates. CoRR abs/1811.12824 (2018) - 2017
- [j28]Benjamin Doerr, Paul Fischer, Astrid Hilbert, Carsten Witt:
Detecting structural breaks in time series via genetic algorithms. Soft Comput. 21(16): 4707-4720 (2017) - [c51]Benjamin Doerr, Christian Gießen, Carsten Witt, Jing Yang:
The (1+λ) evolutionary algorithm with self-adjusting mutation rate. GECCO 2017: 1351-1358 - [i17]Benjamin Doerr, Christian Gießen, Carsten Witt, Jing Yang:
The (1+λ) Evolutionary Algorithm with Self-Adjusting Mutation Rate. CoRR abs/1704.02191 (2017) - 2016
- [j27]Benjamin Doerr, Carsten Witt:
Guest Editorial: Theory of Evolutionary Computation. Algorithmica 75(3): 425-427 (2016) - 2013
- [c38]Benjamin Doerr, Dirk Sudholt, Carsten Witt:
When do evolutionary algorithms optimize separable functions in parallel? FOGA 2013: 51-64 - [c37]Benjamin Doerr, Paul Fischer, Astrid Hilbert, Carsten Witt:
Evolutionary algorithms for the detection of structural breaks in time series: extended abstract. GECCO (Companion) 2013: 119-120 - [c35]Benjamin Doerr, Thomas Jansen, Carsten Witt, Christine Zarges:
A method to derive fixed budget results from expected optimisation times. GECCO 2013: 1581-1588 - 2011
- [j15]Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carsten Witt:
Runtime analysis of the 1-ANT ant colony optimizer. Theor. Comput. Sci. 412(17): 1629-1644 (2011) - [c27]Benjamin Doerr, Mahmoud Fouz, Carsten Witt:
Sharp bounds by probability-generating functions and variable drift. GECCO 2011: 2083-2090 - 2010
- [c23]Benjamin Doerr, Mahmoud Fouz, Carsten Witt:
Quasirandom evolutionary algorithms. GECCO 2010: 1457-1464 - 2007
- [c11]Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carsten Witt:
On the runtime analysis of the 1-ANT ACO algorithm. GECCO 2007: 33-40
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 23:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint