473 search results - page 40 / 95 » Rank based variation operators for genetic algorithms |
AISC
2006
Springer
14 years 2 months ago
2006
Springer
Solving analytic systems using inversion can be implemented in a variety of ways. One method is to use Lagrange inversion and variations. Here we present a different approach, base...
ASPDAC
2009
ACM
14 years 4 months ago
2009
ACM
— Recent advances in statistical timing analysis (SSTA) achieve great success in computing arrival times under variations by extending sum and maximum operations to random variab...
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
In a large-scale language detection task, performance variation found between different component systems and different target languages has an adverse effect to the pooled error ...
GECCO
2010
Springer
14 years 1 months ago
2010
Springer
We use affine arithmetic to improve both the performance and the robustness of genetic programming for symbolic regression. During evolution, we use affine arithmetic to analyze e...
ISMB
1994
13 years 11 months ago
1994
Homologydetection in large data bases is probably the most time consuming operation in molecular genetic computing systems. Moreover, the progresses made all around the world conc...