default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Hellwig
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c16]David Hutter, Michael Hellwig, Thomas Steinberger:
An Interior-point Genetic Algorithm with Restarts for Flexible Job Shop Scheduling Problems. CEC 2024: 1-9- [c15]Dominik Andreas Kowieski, Michael Hellwig, Thomas Feilhauer:
TAPASGO: Transfer Learning towards a German-Language Tabular Question Answering Model. LREC/COLING 2024: 15579-15584 - [i5]Martin Dobler, Michael Hellwig, Nuno Lopes, Ken Oakley, Mike Winterburn:
Systematic review, analysis, and characterisation of malicious industrial network traffic datasets for aiding Machine Learning algorithm performance testing. CoRR abs/2405.04866 (2024) - [i4]Michael Hellwig, Hans-Georg Beyer:
Analyzing design principles for competitive evolution strategies in constrained search spaces. CoRR abs/2405.05005 (2024) - 2023
- [c14]Felix Salcher, Steffen Finck, Michael Hellwig
:
Automated Process Capability Analysis for Product Quality Improvements. ICE/ITMC 2023: 1-9 - [c13]Michael Hellwig, Steffen Finck:
Joining Emission Data from Diverse Economic Activity Taxonomies with Evolution Strategies. LOD (1) 2023: 415-429 - 2022
- [c12]Michael Hellwig, Hans-Georg Beyer:
Benchmarking ϵMAg-ES and BP-ϵMAg-ES on the bbob-constrained testbed. GECCO Companion 2022: 1717-1724 - 2021
- [c11]Michael Hellwig, Steffen Finck, Thomas Mootz, Andreas Ehe, Florian Rein:
NLP for Product Safety Risk Assessment: - Towards Consistency Evaluations of Human Expert Panels. ISDA 2021: 266-276 - [e1]Steffen Finck, Michael Hellwig, Pietro S. Oliveto:
FOGA '21: Foundations of Genetic Algorithms XVI, Virtual Event, Austria, September 6-8, 2021. ACM 2021, ISBN 978-1-4503-8352-3 [contents] - 2020
- [j6]Michael Hellwig, Hans-Georg Beyer:
On the steady state analysis of covariance matrix self-adaptation evolution strategies on the noisy ellipsoid model. Theor. Comput. Sci. 832: 98-122 (2020) - [c10]Michael Hellwig, Hans-Georg Beyer:
A Modified Matrix Adaptation Evolution Strategy with Restarts for Constrained Real-World Problems. CEC 2020: 1-8
2010 – 2019
- 2019
- [j5]Michael Hellwig, Hans-Georg Beyer:
Benchmarking evolutionary algorithms for single objective real-valued constrained optimization - A critical review. Swarm Evol. Comput. 44: 927-944 (2019) - [j4]Patrick Spettel, Hans-Georg Beyer, Michael Hellwig:
A Covariance Matrix Self-Adaptation Evolution Strategy for Optimization Under Linear Constraints. IEEE Trans. Evol. Comput. 23(3): 514-524 (2019) - [c9]Patrick Spettel, Hans-Georg Beyer, Michael Hellwig:
Steady state analysis of a multi-recombinative meta-ES on a conically constrained problem with comparison to σSA and CSA. FOGA 2019: 43-57 - [c8]Michael Hellwig, Hans-Georg Beyer:
Analysis of a meta-ES on a conically constrained problem. GECCO 2019: 673-681 - [c7]Michael Hellwig, Patrick Spettel, Hans-Georg Beyer:
Comparison of contemporary evolutionary algorithms on the rotated Klee-Minty problem. GECCO (Companion) 2019: 1879-1887 - 2018
- [c6]Michael Hellwig, Hans-Georg Beyer:
A Matrix Adaptation Evolution Strategy for Constrained Real-Parameter Optimization. CEC 2018: 1-8 - [c5]Michael Hellwig, Hans-Georg Beyer:
A Linear Constrained Optimization Benchmark for Probabilistic Search Algorithms: The Rotated Klee-Minty Problem. TPNC 2018: 139-151 - [i3]Michael Hellwig, Hans-Georg Beyer:
Benchmarking Evolutionary Algorithms For Real-valued Constrained Optimization - A Critical Review. CoRR abs/1806.04563 (2018) - [i2]Patrick Spettel, Hans-Georg Beyer, Michael Hellwig:
A Covariance Matrix Self-Adaptation Evolution Strategy for Linear Constrained Optimization. CoRR abs/1806.05845 (2018) - [i1]Michael Hellwig, Hans-Georg Beyer:
A Linear Constrained Optimization Benchmark For Probabilistic Search Algorithms: The Rotated Klee-Minty Problem. CoRR abs/1807.10068 (2018) - 2017
- [b1]Michael Hellwig:
Analysis of mutation strength adaptation within evolution strategies on the ellipsoid model and methods for the treatment of fitness noise. University of Ulm, Germany, 2017 - [c4]Hans-Georg Beyer, Michael Hellwig:
Analysis of the pcCMSA-ES on the noisy ellipsoid model. GECCO 2017: 689-696 - 2016
- [j3]Michael Hellwig, Dirk V. Arnold:
Comparison of Constraint-Handling Mechanisms for the (1, λ)-ES on a Simple Constrained Problem. Evol. Comput. 24(1): 1-23 (2016) - [j2]Hans-Georg Beyer, Michael Hellwig:
The Dynamics of Cumulative Step Size Adaptation on the Ellipsoid Model. Evol. Comput. 24(1): 25-57 (2016) - [j1]Michael Hellwig, Hans-Georg Beyer:
Mutation strength control via meta evolution strategies on the ellipsoid model. Theor. Comput. Sci. 623: 160-179 (2016) - [c3]Michael Hellwig, Hans-Georg Beyer:
Evolution Under Strong Noise: A Self-Adaptive Evolution Strategy Can Reach the Lower Performance Bound - The pcCMSA-ES. PPSN 2016: 26-36 - 2013
- [c2]Hans-Georg Beyer, Michael Hellwig:
Controlling population size and mutation strength by Meta-ES under fitness noise. FOGA 2013: 11-24 - 2012
- [c1]Hans-Georg Beyer, Michael Hellwig:
Mutation strength control by meta-ES on the sharp ridge. GECCO 2012: 305-312
Coauthor Index
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-08-21 21:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
