The use of tail inequalities on the probable computational time of randomized search heuristics (Q428911)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The use of tail inequalities on the probable computational time of randomized search heuristics |
scientific article; zbMATH DE number 6049410
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The use of tail inequalities on the probable computational time of randomized search heuristics |
scientific article; zbMATH DE number 6049410 |
Statements
The use of tail inequalities on the probable computational time of randomized search heuristics (English)
0 references
25 June 2012
0 references
computational complexity
0 references
evolutionary algorithms (EAs)
0 references
expected running time
0 references
probable computational time (PCT)
0 references
randomized search heuristics (RSHs)
0 references
tail inequalities
0 references
0 references
0 references
0 references
0 references
0 references
0 references
