Sciweavers

GECCO
2006
Springer
195views Optimization» more  GECCO 2006»
14 years 7 days ago
Studying XCS/BOA learning in Boolean functions: structure encoding and random Boolean functions
Recently, studies with the XCS classifier system on Boolean functions have shown that in certain types of functions simple crossover operators can lead to disruption and, conseque...
Martin V. Butz, Martin Pelikan
GECCO
2006
Springer
177views Optimization» more  GECCO 2006»
14 years 7 days ago
Hyper-ellipsoidal conditions in XCS: rotation, linear approximation, and solution structure
The learning classifier system XCS is an iterative rulelearning system that evolves rule structures based on gradient-based prediction and rule quality estimates. Besides classifi...
Martin V. Butz, Pier Luca Lanzi, Stewart W. Wilson
GECCO
2006
Springer
184views Optimization» more  GECCO 2006»
14 years 7 days ago
Genetic algorithms and mixed integer linear programs for optimal strategies in a student's "sports" activity
This paper uses an entertaining student "sports" game to illustrate that GAs can be adapted to problems with uncertain properties and complexity. These problems can be s...
Thomas Butter, Franz Rothlauf, Jörn Grahl, To...
GECCO
2006
Springer
133views Optimization» more  GECCO 2006»
14 years 7 days ago
A general coarse-graining framework for studying simultaneous inter-population constraints induced by evolutionary operations
The use of genotypic populations is necessary for adaptation in Evolutionary Algorithms. We use a technique called form-invariant commutation to study the immediate effect of evol...
Keki M. Burjorjee, Jordan B. Pollack
GECCO
2006
Springer
178views Optimization» more  GECCO 2006»
14 years 7 days ago
Adaptively choosing niching parameters in a PSO
Niching techniques play an important role in evolutionary algorithms. Existing niching methods often require userspecified parameters, limiting their usefulness. This paper propos...
Stefan Bird, Xiaodong Li
GECCO
2006
Springer
175views Optimization» more  GECCO 2006»
14 years 7 days ago
An ant-based algorithm for finding degree-constrained minimum spanning tree
A spanning tree of a graph such that each vertex in the tree has degree at most d is called a degree-constrained spanning tree. The problem of finding the degree-constrained spann...
Thang Nguyen Bui, Catherine M. Zrncic
GECCO
2006
Springer
152views Optimization» more  GECCO 2006»
14 years 7 days ago
An agent-based algorithm for generalized graph colorings
This paper presents an algorithm for solving a number of generalized graph coloring problems. Specifically, it gives an agent-based algorithm for the Bandwidth Coloring problem. U...
Thang Nguyen Bui, ThanhVu H. Nguyen
GECCO
2006
Springer
124views Optimization» more  GECCO 2006»
14 years 7 days ago
An efficient approach to unbounded bi-objective archives -: introducing the mak_tree algorithm
Given the prominence of elite archiving in contemporary multiobjective optimisation research and the limitations inherent in bounded population sizes, it is unusual that the vast ...
Adam Berry, Peter Vamplew
GECCO
2006
Springer
123views Optimization» more  GECCO 2006»
14 years 7 days ago
Reconsidering the progress rate theory for evolution strategies in finite dimensions
This paper investigates the limits of the predictions based on the classical progress rate theory for Evolution Strategies. We explain on the sphere function why positive progress...
Anne Auger, Nikolaus Hansen
GECCO
2006
Springer
147views Optimization» more  GECCO 2006»
14 years 7 days ago
Deceptiveness and neutrality the ND family of fitness landscapes
When a considerable number of mutations have no effects on fitness values, the fitness landscape is said neutral. In order to study the interplay between neutrality, which exists ...
William Beaudoin, Sébastien Vérel, P...