10890 search results - page 1818 / 2178 » Automatic Complexity Analysis |
167
click to vote
GECCO
2007
Springer
16 years 25 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...
170
click to vote
GECCO
2007
Springer
16 years 25 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...
157
click to vote
GECCO
2007
Springer
16 years 25 days ago
2007
Springer
In this paper, a model based on genetic algorithms for protein folding prediction is proposed. The most important features of the proposed approach are: i) Heuristic secondary str...
185
click to vote
GECCO
2007
Springer
16 years 25 days ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
189
click to vote
GRID
2007
Springer
16 years 25 days ago
2007
Springer
— Scientific applications often perform complex computational analyses that consume and produce large data sets. We are concerned with data placement policies that distribute dat...