Sciweavers

15485 search results - page 2725 / 3097
» Computing Optimal Subsets
Sort
View
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
16 years 8 days ago
Comparing multicast and newscast communication in evolving agent societies
This paper investigates the effects of two different communication protocols within an artificial society, where communication and cooperation is necessary to survive. Communicat...
A. E. Eiben, Martijn C. Schut, T. Toma
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
16 years 8 days ago
A statistical learning theory approach of bloat
Code bloat, the excessive increase of code size, is an important issue in Genetic Programming (GP). This paper proposes a theoretical analysis of code bloat in the framework of sy...
Sylvain Gelly, Olivier Teytaud, Nicolas Bredeche, ...
204
Voted
GECCO
2005
Springer
158views Optimization» more  GECCO 2005»
16 years 8 days ago
Applying both positive and negative selection to supervised learning for anomaly detection
This paper presents a novel approach of applying both positive selection and negative selection to supervised learning for anomaly detection. It first learns the patterns of the n...
Xiaoshu Hang, Honghua Dai
GECCO
2005
Springer
116views Optimization» more  GECCO 2005»
16 years 8 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
160views Optimization» more  GECCO 2005»
16 years 8 days ago
On the complexity of hierarchical problem solving
Competent Genetic Algorithms can efficiently address problems in which the linkage between variables is limited to a small order k. Problems with higher order dependencies can onl...
Edwin D. de Jong, Richard A. Watson, Dirk Thierens
« Prev « First page 2725 / 3097 Last » Next »