627 search results - page 12 / 126 » How optimal is the genetic code |
110
Voted
PR
1998
15 years 12 days ago
1998
This paper describes a method for optimizing the cost matrix of any approximate string matching algorithm based on the Levenshtein distance. The method, which uses genetic algorit...
108
Voted
ICPPW
2002
IEEE
15 years 5 months ago
2002
IEEE
The effectiveness of the memory hierarchy is critical for the performance of current processors. The performance of the memory hierarchy can be improved by means of program transf...
ECAL
2007
Springer
15 years 7 months ago
2007
Springer
Our agent-based model of genotype editing is defined by two distinct genetic components: a coding portion encoding phenotypic solutions, and a non-coding portion used to edit the ...
111
Voted
CLUSTER
2008
IEEE
15 years 7 months ago
2008
IEEE
—This paper describes the application of various search techniques to the problem of automatic empirical code optimization. The search process is a critical aspect of auto-tuning...
109
Voted
EUROGP
2009
Springer
15 years 7 months ago
2009
Springer
Code bloat, the excessive increase of code size, is an important issue in Genetic Programming (GP). This paper proposes a theoretical analysis of code bloat in GP from the perspec...