129 search results - page 10 / 26 » Holographic String Encoding |
ACTA
2007
13 years 7 months ago
2007
The study of hairpin-free words has been initiated in the context of DNA computing. DNA strands that, theoretically speaking, are finite strings over the alphabet {A, G, C, T} are...
PODS
2010
ACM
14 years 22 days ago
2010
ACM
A generalization from string to trees and from languages to translations is given of the classical result that any regular language can be learned from examples: it is shown that ...
ASSETS
2005
ACM
13 years 9 months ago
2005
ACM
While strings and syntax trees are used by the Natural Language Processing community to represent the structure of spoken languages, these encodings are difficult to adapt to a si...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
This paper describes a speciation method that allows an evolutionary process to learn several robot behaviors using a single execution. Species are created in behavioral space in ...
CEC
2005
IEEE
14 years 1 months ago
2005
IEEE
An L-system or Lindenmayer system consists of a grammar and an interpreter. The grammar contains an axiom, usually a short string, that the grammar expands into a long, complex st...