2152 search results - page 297 / 431 » Backward-chaining evolutionary algorithms |
153
Voted
KES
1999
Springer
15 years 8 months ago
1999
Springer
Abstract—Dynamic Demes is a new method for the parallelisation of evolutionary algorithms. It was derived as a combination of two other parallelisation algorithms: the master-sla...
134
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
148
Voted
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
When facing dynamic optimization problems the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. Over these kind of ov...
128
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
Recent research into single–objective continuous Estimation– of–Distribution Algorithms (EDAs) has shown that when maximum–likelihood estimations are used for parametric d...
134
click to vote
GECCO
2007
Springer
15 years 7 months ago
2007
Springer
Identification of Transcription Factor Binding Site (TFBS) motifs in multiple DNA upstream sequences is important in understanding the mechanism of gene regulation. This identific...