Skip to main navigation
Skip to search
Skip to main content
University of Birmingham Home
Help & FAQ
Home
Research output
Profiles
Research units
Projects
Activities
Datasets
Equipment
Prizes
Press/Media
Search by expertise, name or affiliation
Parallel black-box complexity with tail bounds
Per Kristian Lehre
, Dirk Sudholt
Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
138
Downloads (Pure)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Parallel black-box complexity with tail bounds'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Black Box
100%
Tail
78%
Unary
57%
Model Complexity
24%
Algorithm Design
23%
Lower bound
23%
Metaheuristics
21%
Evaluation Function
21%
Evolutionary Algorithms
20%
Performance
20%
Combinatorial Optimization
20%
Search Algorithm
20%
Parallelism
19%
Parallel Algorithms
19%
Optimal Algorithm
19%
Inertia
19%
Optimise
18%
Target
14%
Optimization
13%
Evaluation
12%
Range of data
10%
Demonstrate
10%
Engineering & Materials Science
Function evaluation
25%
Combinatorial optimization
24%
Parallel algorithms
20%
Evolutionary algorithms
20%