Results 1  10
of
603,028
A median success rule for nonelitist evolution strategies: Study of feasibility. Inria, 2013. Preprint with appendix on http://hal.inria.fr/hal00801414
"... HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte p ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
pluridisciplinaire HAL, est destinée au dépôt et a ̀ la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.
Author manuscript, published in "Genetic and Evolutionary Computation Conference (2013)" A Median Success Rule for NonElitist Evolution Strategies: Study of Feasibility
, 2013
"... Success rule based stepsize adaptation, namely the onefifth success rule, has shown to be effective for single parent evolution strategies (ES), e.g. the (1+1)ES. The success rule remains feasible in nonelitist single parent strategies, where the target success rate must be roughly inversely pro ..."
Abstract
 Add to MetaCart
Success rule based stepsize adaptation, namely the onefifth success rule, has shown to be effective for single parent evolution strategies (ES), e.g. the (1+1)ES. The success rule remains feasible in nonelitist single parent strategies, where the target success rate must be roughly inversely
Convergence of non{elitist strategies
 In Proceedings of the First IEEE Conference on Computational Intelligence
, 1994
"... Abstract  This paper o ers su cient conditions to prove global convergence of non{elitist evolutionary algorithms. If these conditions can be applied they yield bounds of the convergence rate as a by{product. This is demonstrated by an example that can be calculated exactly. ..."
Abstract

Cited by 32 (4 self)
 Add to MetaCart
Abstract  This paper o ers su cient conditions to prove global convergence of non{elitist evolutionary algorithms. If these conditions can be applied they yield bounds of the convergence rate as a by{product. This is demonstrated by an example that can be calculated exactly.
The Convergence Mechanism and Strategies for NonElitist Genetic Programming
"... Abstract—Genetic programming is an evolutionary algorithm that proposed to solve the automatic computer program design problem by J.R.Koza in the 1990s. It has good universality and intelligence, and has been widely applied in the field of computer engineering. But genetic programming is essentially ..."
Abstract
 Add to MetaCart
is essentially a stochastic optimization algorithm, lack theoretic basis on the convergence of algorithm, which limit the scope of its application in some extent. The convergence mechanism of nonelitist genetic programming was studied in this paper. A recursive estimation of the probability of population
Strategies of Discourse Comprehension
, 1983
"... El Salvador, Guatemala is a, study in black and white. On the left is a collection of extreme MarxistLeninist groups led by what one diplomat calls “a pretty faceless bunch of people.’ ’ On the right is an entrenched elite that has dominated Central America’s most populous country since a CIAbacke ..."
Abstract

Cited by 601 (27 self)
 Add to MetaCart
El Salvador, Guatemala is a, study in black and white. On the left is a collection of extreme MarxistLeninist groups led by what one diplomat calls “a pretty faceless bunch of people.’ ’ On the right is an entrenched elite that has dominated Central America’s most populous country since a CIA
Dynamic Itemset Counting and Implication Rules for Market Basket Data
, 1997
"... We consider the problem of analyzing marketbasket data and present several important contributions. First, we present a new algorithm for finding large itemsets which uses fewer passes over the data than classic algorithms, and yet uses fewer candidate itemsets than methods based on sampling. We in ..."
Abstract

Cited by 599 (6 self)
 Add to MetaCart
investigate the idea of item reordering, which can improve the lowlevel efficiency of the algorithm. Second, we present a new way of generating "implication rules," which are normalized based on both the antecedent and the consequent and are truly implications (not simply a measure of co
A Fast and Elitist MultiObjective Genetic Algorithm: NSGAII
, 2000
"... Multiobjective evolutionary algorithms which use nondominated sorting and sharing have been mainly criticized for their (i) O(MN computational complexity (where M is the number of objectives and N is the population size), (ii) nonelitism approach, and (iii) the need for specifying a sharing param ..."
Abstract

Cited by 1707 (58 self)
 Add to MetaCart
Multiobjective evolutionary algorithms which use nondominated sorting and sharing have been mainly criticized for their (i) O(MN computational complexity (where M is the number of objectives and N is the population size), (ii) nonelitism approach, and (iii) the need for specifying a sharing
Near Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
, 2004
"... Suppose we are given a vector f in RN. How many linear measurements do we need to make about f to be able to recover f to within precision ɛ in the Euclidean (ℓ2) metric? Or more exactly, suppose we are interested in a class F of such objects— discrete digital signals, images, etc; how many linear m ..."
Abstract

Cited by 1513 (20 self)
 Add to MetaCart
Suppose we are given a vector f in RN. How many linear measurements do we need to make about f to be able to recover f to within precision ɛ in the Euclidean (ℓ2) metric? Or more exactly, suppose we are interested in a class F of such objects— discrete digital signals, images, etc; how many linear
Application of Phylogenetic Networks in Evolutionary Studies
 SUBMITTED TO MBE 2005
, 2005
"... The evolutionary history of a set of taxa is usually represented by a phylogenetic tree, and this model has greatly facilitated the discussion and testing of hypotheses. However, it is well known that more complex evolutionary scenarios are poorly described by such models. Further, even when evoluti ..."
Abstract

Cited by 867 (15 self)
 Add to MetaCart
evolution proceeds in a treelike manner, analysis of the data may not be best served by using methods that enforce a tree structure, but rather by a richer visualization of the data to evaluate its properties, at least as an essential first step. Thus, phylogenetic networks should be employed when
Evolution of indirect reciprocity by image scoring, Nature
, 1998
"... review. Views or opinions expressed herein do not necessarily represent those of the Institute, its National Member Organizations, or other organizations supporting the work. IIASA STUDIES IN ADAPTIVE DYNAMICS NO. 27 The Adaptive Dynamics Network at IIASA fosters the development of new mathematical ..."
Abstract

Cited by 486 (16 self)
 Add to MetaCart
review. Views or opinions expressed herein do not necessarily represent those of the Institute, its National Member Organizations, or other organizations supporting the work. IIASA STUDIES IN ADAPTIVE DYNAMICS NO. 27 The Adaptive Dynamics Network at IIASA fosters the development of new mathematical
Results 1  10
of
603,028