627 search results - page 52 / 126 » How optimal is the genetic code |
118
Voted
CEC
2007
IEEE
15 years 2 months ago
2007
IEEE
— As there are many good optimization algorithms each with its own characteristics, it is very difficult to choose the best method for optimization problems. Thus, it is importa...
120
Voted
GECCO
2009
Springer
14 years 11 months ago
2009
Springer
We deepen the theoretical analysis of the genetic algorithm for the all-pairs shortest path problem proposed by Doerr, Happ and Klein (GECCO 2008). We show that the growth of the ...
74
Voted
ISSAC
2007
Springer
15 years 7 months ago
2007
Springer
Supercomputing applications usually involve the repeated parallel application of discretized differential operators. Difficulties arise with higher-order discretizations of opera...
121
Voted
GECCO
2008
Springer
15 years 2 months ago
2008
Springer
The crossover bias theory for bloat [18] is a recent result which predicts that bloat is caused by the sampling of short, unfit programs. This theory is clear and simple, but it ...
137
Voted
SSS
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. This paper evaluates the performance of two seminal rateless erasure codes, LT Codes and Online Codes. Their properties make them appropriate for coping with communicatio...