Differential Evolution for Strongly Noisy Optimization: Use 1.01$^n$ Resamplings at Iteration n and Reach the -1/2 Slope

Nous avons appliqué le préchargement à plusieurs endroits dans le programme : à la fois dans les copies des blocs des matrices A et B pour masquer la latence entre le second niveau

We analyse two different schemes for an adaptive control and prove sufficient conditions ensuring the existence of an homogeneous Markov chain, which is the first step to prove

In this section, we prove oracle complexity lower bounds for distributed optimization in two set- tings: strongly convex and smooth functions for centralized (i.e. master/slave)

In this paper, we consider the different types of system reliability optimization problems, including as examples, the redundancy allocation problem (RAP), the

Section 2.2 presents results in the scale invariant case, for an exponential number of resamplings and non-adaptive rules.. Section 2.3 will focus on adaptive rules, with numbers

In the noisy case, noisy fitness values lead to a log-log convergence (i.e. the logarithm of the distance to the optimum typically scales linearly with the logarithm of number

We calculate density-density correlations of an expanding gas of strongly attractive ultra-cold spin-1/2 fermions in an optical lattice.. The phase diagram of the tightly bound

the number of successful trials (#); the expected running time to surpass f opt + ∆f (ERT, see Figure 1); the 10%-tile and 90%-tile of the bootstrap distribution of ERT; the