Sciweavers

4908 search results - page 779 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
GECCO
2005
Springer
116views Optimization» more  GECCO 2005»
16 years 3 days ago
Measuring, enabling and comparing modularity, regularity and hierarchy in evolutionary design
For computer-automated design systems to scale to complex designs they must be able to produce designs that exhibit the characteristics of modularity, regularity and hierarchy –...
Gregory Hornby
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
16 years 3 days ago
Evolutionary computation and the c-value paradox
The C-value Paradox is the name given in biology to the wide variance in and often very large amount of DNA in eukaryotic genomes and the poor correlation between DNA length and p...
Sean Luke
GECCO
2005
Springer
142views Optimization» more  GECCO 2005»
16 years 3 days ago
Genetic programming: parametric analysis of structure altering mutation techniques
We hypothesize that the relationship between parameter settings, speci cally parameters controlling mutation, and performance is non-linear in genetic programs. Genetic programmin...
Alan Piszcz, Terence Soule
GECCO
2005
Springer
112views Optimization» more  GECCO 2005»
16 years 3 days ago
Towards an empirical measure of evolvability
Genetic representations that do not employ a one-to-one mapping of genotype to phenotype are known as indirect encodings, and can be much more efficient than direct encodings for ...
Joseph Reisinger, Kenneth O. Stanley, Risto Miikku...
GECCO
2005
Springer
121views Optimization» more  GECCO 2005»
16 years 3 days ago
An evolutionary algorithm to generate hyper-ellipsoid detectors for negative selection
This paper introduces hyper-ellipsoids as an improvement to hyper-spheres as intrusion detectors in a negative selection problem within an artificial immune system. Since hyper-s...
Joseph M. Shapiro, Gary B. Lamont, Gilbert L. Pete...