The fitness-level technique is a simple and old way to derive upper bounds for the expected runtime of simple elitist evolutionary algorithms (EAs). Recently, the technique has been adapted to deduce the runtime of algorithms with non-elitist populations and unary variation operators [2,8]. In this paper, we show that the restriction to unary variation operators can be removed. This gives rise ...

The problem of density estimation on R is concerned. Adopting the maxiset point of view, the aim of this paper is threefold. Firstly, we prove that the maxiset of any elitist rule is contained in the intersection of a Besov space and a weak Besov space. Secondly, we provide an adaptive procedure for which the maxiset is the largest one among elitist rules (ideal maxiset). Thirdly, we point out ...

Designing virtual topologies is necessary to obtain maximum performance of optical networks. In this paper the routing and wavelength assignation (RWA) is computed using an elitist team of multiobjective evolutionary algorithms, which proposes converting the original RWA problem into a problem of traditional routing, thereby modifying the graph that represents the optical network. The Elitist T...

Quantum-behaved Particle Swarm Optimization (QPSO) algorithm is a global convergence guaranteed algorithms, which outperforms traditional PSOs in search ability as well as having fewer parameters to control. In this paper, in order to depict the thinking model of people accurately that the decision-making is always influenced by the important part factors which we called elitist, so elitist mea...

This paper shows that the design of education policy involves a potential conflict between welfare and social mobility. We consider a setting in which social mobility is maximized under the least elitist public education system, whereas welfare maximization calls for the most elitist system. We show that when private education is available, the degree of elitism that maximizes social mobility i...

We present a set of strong cues for stop place of articulation, based upon formant transition slopes. This set complements a first one defined from stop bursts. Strong cues, which identify or eliminate a phonetic feature with certainty (no error is allowed), are not systematically fired. They can be exploited in language learning (cue enhancement) or in ASR to reduce the search space during the...

In this work we examine the effect of elitist and non-elitist selection on a supply chain problem. The problem is characterized by an output constraint which in turn separates the search space in a feasible and a non-feasible region. Additionally the simulation output is noisy due to a stochastic demand model. We will show analyze which strategy is able to perform a walk on the boundary between...

In [5] an evolutionary algorithm for detecting continuous Pareto optimal sets has been proposed. In this paper we propose a new evolutionary elitist approach combing a non-standard solution representation and an evolutionary optimization technique. The proposed method permits detection of continuous decision regions. In our approach an individual (a solution) is either a closed interval or a po...