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
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The use of tail inequalities on the probable computational time of randomized search heuristics |
scientific article |
Statements
The use of tail inequalities on the probable computational time of randomized search heuristics (English)
0 references
25 June 2012
0 references
