Results 1 to 10 of about 33,247 (164)
Analysis of smart imaging runtime
Smart microscopy is a new imaging approach that involves rapid imaging, prediction of important subregions, then selective re-imaging. This approach has been validated in reducing imaging beam time in electron microscopy connectomics, but the speedup ...
Thomas Athey +9 more
doaj +4 more sources
On the runtime analysis of the Simple Genetic Algorithm
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pietro S Oliveto, Carsten Witt
exaly +2 more sources
Analysis of the development Android’s runtime
The article presents the development of the Android runtime. Own application for Android is presented, which implements performance benchmarks used to test different versions of the Android runtime.
Kostiantyn Honcharenko, Jakub Smołka
doaj +3 more sources
Fixed-target runtime analysis [PDF]
This is an extended version of a paper which appeared at GECCO ...
Buzdalov, Maxim +3 more
openaire +5 more sources
METHOD OF ARTIFICIAL FITNESS LEVELS FOR DYNAMICS ANALYSIS OF EVOLUTIONARY ALGORITHMS [PDF]
Subject of Research. Currently, in the theory of evolutionary computation, it becomes relevant to analyze not just the runtime of evolutionary algorithms, but also their dynamics.
Maxim V. Buzdalov, Dmitry V. Vinokurov
doaj +1 more source
Fourier Analysis Meets Runtime Analysis: Precise Runtimes on Plateaus
43 pages. This is the full version of a paper appearing in the proceedings of GECCO 2023.
Benjamin Doerr, Andrew James Kelley
openaire +3 more sources
Optimized use of Wavelet Packet Trees for the analysis of electrical waveforms [PDF]
Wavelet packet trees represent a topic which grows in popularity when it comes to analysis of electrical waveforms. It allows for time-frequency analysis providing information on narrower ranges of frequency (as compared to the faster Discrete Wavelet ...
Nicolae Ileana-Diana V.D. +3 more
doaj +1 more source
Runtime Analysis with Variable Cost
Abstract The usual approach in runtime analysis is to derive estimates on the number of fitness function evaluations required by a method until a suitable element of the search space is found. One justification for this is that in real applications, fitness evaluation often contributes the most computational effort. A tacit assumption in this
Per Kristian Lehre, Andrew M. Sutton
openaire +1 more source
Hitting times of local and global optima in genetic algorithms with very high selection pressure [PDF]
The paper is devoted to upper bounds on the expected first hitting times of the sets of local or global optima for non-elitist genetic algorithms with very high selection pressure.
Eremeev Anton V.
doaj +1 more source
Runtime analysis of binary PSO [PDF]
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and a swarm of particles. Each particle consists of a current position, an own best position and a velocity vector used in a probabilistic process to update the particle's ...
Sudholt, Dirk, Witt, Carsten
openaire +5 more sources

