Results 201 to 210 of about 305,569 (242)

Direct Oral anticoagulants in pulmonary thromboembolism therapy: the generalization-individualization dilemma and the path to risk stratification-a perspective. [PDF]

Front Med (Lausanne)
Meng C, Wang H.
europepmc   +1 more source

Heuristically Adaptive Diffusion-Model Evolutionary Strategy. [PDF]

Adv Sci (Weinh)
Hartl B, Zhang Y, Hazan H, Levin M.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

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

Information Processing Letters, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Carsten Witt
exaly   +4 more sources

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

Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation, 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. Recently, randomized search heuristics have been examined regarding their achievable progress within a fixed time budget. We follow this
Dirk Sudholt, Frank Neumann
exaly   +3 more sources

Evolutionary Algorithms and Other Randomized Search Heuristics

Natural Computing Series, 2013
In our description of evolutionary algorithms we make use of terms that stem from biology, hinting at the roots of evolutionary algorithms. We adhere to these standard notions as long as they do not collide with standard notions in computer science. Evolutionary algorithms are structurally very simple.
Thomas Jansen
exaly   +3 more sources

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

Algorithmica, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Benjamin Doerr, Carola Doerr
semanticscholar   +4 more sources

Random combinatorial structures and randomized search heuristics

, 2010
Diese Dissertationsschrift beschäftigt sich mit der wahrscheinlichkeitstheoretischen Analyse von zufälligen kombinatorischen Strukturen und der Laufzeitanalyse randomisierter Suchheuristiken. Im Bereich der zufälligen Strukturen untersuchen wir zwei Klassen kombinatorischer Objekte.
Daniel Johannsen
semanticscholar   +4 more sources

Maximal age in randomized search heuristics with aging

Proceedings of the 11th Annual conference on Genetic and evolutionary computation, 2009
The concept of aging has been introduced and applied in many different variants in many different randomized search heuristics. The most important parameter is the maximal age of search points. Considering static pure aging known from artificial immune systems in the context of simple evolutionary algorithms, it is demonstrated that the choice of this ...
Christian Horoba, T. Jansen, C. Zarges
semanticscholar   +2 more sources

Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift

International Symposium on Algorithms and Computation, 2014
Drift analysis is one of the state-of-the-art techniques for the runtime analysis of randomized search heuristics (RSHs) such as evolutionary algorithms (EAs), simulated annealing etc. The vast majority of existing drift theorems yield bounds on the expected value of the hitting time for a target state, e.
Orbit
semanticscholar   +3 more sources