8 search results - page 1 / 2 » String Rewriting Grammar Optimized Using an Evolvability Mea... |
74
Voted
ECAL
2001
Springer
15 years 4 months ago
2001
Springer
125
Voted
GECCO
2004
Springer
15 years 5 months ago
2004
Springer
Chemical Genetic Programming (CGP) is a new method of genetic programming that introduced collision-based biochemical processes and realized dynamic mapping from genotypic strings ...
103
Voted
ACL
2010
14 years 10 months ago
2010
Linear Context-Free Rewriting Systems (LCFRSs) are a grammar formalism capable of modeling discontinuous phrases. Many parsing applications use LCFRSs where the fan-out (a measure...
105
click to vote
EUROGP
2003
Springer
15 years 5 months ago
2003
Springer
Finite state transducers (FSTs) are finite state machines that map strings in a source domain into strings in a target domain. While there are many reports in the literature of ev...
107
click to vote
EUROGP
2001
Springer
15 years 4 months ago
2001
Springer
This work is a study of neutrality in the context of Evolutionary Computation systems. In particular, we introduce the use of explicit neutrality with an integer string coding sche...