Solving problems with unknown solution length at almost no extra cost (Q1725649)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7023732
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving problems with unknown solution length at almost no extra cost |
scientific article; zbMATH DE number 7023732 |
Statements
Solving problems with unknown solution length at almost no extra cost (English)
0 references
14 February 2019
0 references
black-box optimization
0 references
evolutionary computation
0 references
runtime analysis
0 references
uncertainty
0 references
unknown solution length
0 references
0 references
0 references
0.8098482489585876
0 references
0.7861894965171814
0 references
0.7564207315444946
0 references
0.7427822947502136
0 references
0.7426234483718872
0 references
