627 search results - page 67 / 126 » How optimal is the genetic code |
117
Voted
ISOLA
2004
Springer
15 years 9 months ago
2004
Springer
Methods for Worst-Case Execution Time (WCET) analysis have been known for some time, and recently commercial tools have emerged. However, the technique has so far not been much use...
92
Voted
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
Evaluating GP schema in context is considered to be a complex, and, at times impossible, task. The tightly linked nodes of a GP tree is the main reason behind its complexity. This...
128
Voted
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
The Push programming language was developed for use in genetic and evolutionary computation systems, as the representation within which evolving programs are expressed. It has bee...
148
Voted
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
Permutations of vertices can represent constrained spanning trees for evolutionary search via a decoder based on Prim’s algorithm, and random keys can represent permutations. Tho...
130
click to vote
CEC
2005
IEEE
15 years 9 months ago
2005
IEEE
The building blocks are common structures of high-quality solutions. Genetic algorithms often assume the building-block hypothesis. It is hypothesized that the high-quality solutio...