4908 search results - page 760 / 982 » On the Complexity of Optimal K-Anonymity |
164
click to vote
GECCO
2007
Springer
16 years 23 days ago
2007
Springer
Tournament selection has been widely used and studied in evolutionary algorithms. To supplement the study of tournament selection, this paper provides several models describing th...
172
click to vote
GECCO
2007
Springer
16 years 23 days ago
2007
Springer
This paper describes a study in the evolution of distributed cooperative behavior, specifically leader election, through digital evolution and group selection. In digital evoluti...
177
click to vote
GECCO
2007
Springer
16 years 23 days ago
2007
Springer
Existing metrics for dynamic optimisation are designed primarily to rate an algorithm’s overall performance. These metrics show whether one algorithm is better than another, but...
167
click to vote
GECCO
2007
Springer
16 years 23 days ago
2007
Springer
One of the most controversial yet enduring hypotheses about what genetic algorithms (GAs) are good for concerns the idea that GAs process building-blocks. More specifically, it ha...
163
click to vote
GECCO
2007
Springer
16 years 23 days ago
2007
Springer
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...