Results 101 to 110 of about 3,716,603 (121)

A fixed budget analysis of randomized search heuristics for the traveling salesperson problem

, 2014
Randomized Search heuristics are frequently applied to NP-hard combinatorial optimization problems. The runtime analysis of randomized search heuristics has contributed tremendously to their theoretical understanding.
Dirk Sudholt, Frank Neumann
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Error analysis of elitist randomized search heuristics

Swarm and Evolutionary Computation, 2021
Cong Wang, Jun He
exaly  

Fitness levels with tail bounds for the analysis of randomized search heuristics

Information Processing Letters, 2014
Carsten Witt
exaly  

The use of tail inequalities on the probable computational time of randomized search heuristics

Theoretical Computer Science, 2012
Ruqian Lu, Zhangang Han
exaly  

Analyzing Randomized Search Heuristics: Tools from Probability Theory

Theoretical Computer Science, 2011
Benjamin Doerr
exaly  

Black-Box Complexity for Bounding the Performance of Randomized Search Heuristics

Natural Computing Series, 2014
Thomas Jansen
exaly  

Parameterized Complexity Analysis of Randomized Search Heuristics

Natural Computing Series, 2020
Frank Neumann, Andrew M. Sutton
exaly  

Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization

Theory of Computing Systems, 2004
Thomas Jansen, Stefan Droste
exaly  

The Impact of Random Initialization on the Runtime of Randomized Search Heuristics

Algorithmica, 2015
Carola Doerr, Benjamin Doerr
exaly