Results 1 - 10 of 3,237

A Fast and Elitist Multi-Objective Genetic Algorithm: NSGA-II

by Kalyanmoy Deb, Amrit Pratap, Sameer Agarwal, T. Meyarivan , 2000
"... Multi-objective evolutionary algorithms which use non-dominated 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) non-elitism approach, and (iii) the need for specifying a sharing param ..."
Abstract - Cited by 1815 (60 self) - Add to MetaCart
Multi-objective evolutionary algorithms which use non-dominated 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) non-elitism approach, and (iii) the need for specifying a sharing

Similarity estimation techniques from rounding algorithms

by Moses S. Charikar - In Proc. of 34th STOC , 2002
"... A locality sensitive hashing scheme is a distribution on a family F of hash functions operating on a collection of objects, such that for two objects x, y, Prh∈F[h(x) = h(y)] = sim(x,y), where sim(x,y) ∈ [0, 1] is some similarity function defined on the collection of objects. Such a scheme leads ..."
Abstract - Cited by 449 (6 self) - Add to MetaCart
to a compact representation of objects so that similarity of objects can be estimated from their compact sketches, and also leads to efficient algorithms for approximate nearest neighbor search and clustering. Min-wise independent permutations provide an elegant construction of such a locality

Predictive Models for the Breeder Genetic Algorithm -- I. Continuous Parameter Optimization

by Heinz Mühlenbein, Dirk Schlierkamp-Voosen - EVOLUTIONARY COMPUTATION , 1993
"... In this paper a new genetic algorithm called the Breeder Genetic Algorithm (BGA) is introduced. The BGA is based on artificial selection similar to that used by human breeders. A predictive model for the BGA is presented which is derived from quantitative genetics. The model is used to predict t ..."
Abstract - Cited by 400 (25 self) - Add to MetaCart
In this paper a new genetic algorithm called the Breeder Genetic Algorithm (BGA) is introduced. The BGA is based on artificial selection similar to that used by human breeders. A predictive model for the BGA is presented which is derived from quantitative genetics. The model is used to predict

Classifier fitness based on accuracy

by Stewart W. Wilson - Evolutionary Computation , 1995
"... In many classifier systems, the classifier strength parameter serves as a predictor of future payoff and as the classifier’s fitness for the genetic algorithm. We investigate a classifier system, XCS, in which each classifier maintains a prediction of expected payoff, but the classifier’s fitness is ..."
Abstract - Cited by 350 (17 self) - Add to MetaCart
In many classifier systems, the classifier strength parameter serves as a predictor of future payoff and as the classifier’s fitness for the genetic algorithm. We investigate a classifier system, XCS, in which each classifier maintains a prediction of expected payoff, but the classifier’s fitness

Population-Based Incremental Learning: A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning

by Shumeet Baluja , 1994
"... Genetic algorithms (GAs) are biologically motivated adaptive systems which have been used, with varying degrees of success, for function optimization. In this study, an abstraction of the basic genetic algorithm, the Equilibrium Genetic Algorithm (EGA), and the GA in turn, are reconsidered within th ..."
Abstract - Cited by 356 (12 self) - Add to MetaCart
the framework of competitive learning. This new perspective reveals a number of different possibilities for performance improvements. This paper explores population-based incremental learning (PBIL), a method of combining the mechanisms of a generational genetic algorithm with simple competitive learning

Self-organisation in a perceptual network

by Ralph Linsker - IEEE Computer , 1988
"... young animal or child perceives and identifies features in its envi-, roument in an apparently effortless way. No presently known algorithms even approach this flexible, generalpurpose perceptual capability. Discovering the principles that may underlie perceptual processing is important both for neu ..."
Abstract - Cited by 364 (0 self) - Add to MetaCart
young animal or child perceives and identifies features in its envi-, roument in an apparently effortless way. No presently known algorithms even approach this flexible, generalpurpose perceptual capability. Discovering the principles that may underlie perceptual processing is important both

Designing Efficient And Accurate Parallel Genetic Algorithms

by Erick Cantú-Paz , 1999
"... Parallel implementations of genetic algorithms (GAs) are common, and, in most cases, they succeed to reduce the time required to find acceptable solutions. However, the effect of the parameters of parallel GAs on the quality of their search and on their efficiency are not well understood. This insuf ..."
Abstract - Cited by 299 (5 self) - Add to MetaCart
Parallel implementations of genetic algorithms (GAs) are common, and, in most cases, they succeed to reduce the time required to find acceptable solutions. However, the effect of the parameters of parallel GAs on the quality of their search and on their efficiency are not well understood

Approximating the nondominated front using the Pareto Archived Evolution Strategy

by Joshua D. Knowles, David W. Corne - EVOLUTIONARY COMPUTATION , 2000
"... We introduce a simple evolution scheme for multiobjective optimization problems, called the Pareto Archived Evolution Strategy (PAES). We argue that PAES may represent the simplest possible nontrivial algorithm capable of generating diverse solutions in the Pareto optimal set. The algorithm, in its ..."
Abstract - Cited by 321 (19 self) - Add to MetaCart
We introduce a simple evolution scheme for multiobjective optimization problems, called the Pareto Archived Evolution Strategy (PAES). We argue that PAES may represent the simplest possible nontrivial algorithm capable of generating diverse solutions in the Pareto optimal set. The algorithm, in its

Object categorization by learned universal visual dictionary

by J. Winn, A. Criminisi, T. Minka - IN ICCV , 2005
"... This paper presents a new algorithm for the automatic recognition of object classes from images (categorization). Compact and yet discriminative appearance-based object class models are automatically learned from a set of training images. The method is simple and extremely fast, making it suitable ..."
Abstract - Cited by 302 (8 self) - Add to MetaCart
This paper presents a new algorithm for the automatic recognition of object classes from images (categorization). Compact and yet discriminative appearance-based object class models are automatically learned from a set of training images. The method is simple and extremely fast, making

Generalization in the XCS Classifier System

by S. W. Wilson , 1998
"... This paper studies two changes to XCS, a classifier system in which fitness is based on prediction accuracy and the genetic algorithm takes place in environmental niches. The changes were aimed at increasing XCS's tendency to evolve accurate, maximally general classifiers and were tested o ..."
Abstract - Cited by 86 (11 self) - Add to MetaCart
This paper studies two changes to XCS, a classifier system in which fitness is based on prediction accuracy and the genetic algorithm takes place in environmental niches. The changes were aimed at increasing XCS's tendency to evolve accurate, maximally general classifiers and were tested
Results 1 - 10 of 3,237