o Search Algorithm - Currently a variable length genetic algorithm. We plan to adopt a competent GA as these have been shown to have scaling properties superior to the simple GA. Note this is a plug-in system component such that any search method can be used that can handle variable-length structures. For example, simulated annealing has been successfully adopted.

o Genotype-Phenotype Mapping (GPM) - A simple gene expression model has been adopted that determines the mapping of a context-free grammar. Notable features here are the degenerate genetic code and the wrapping operator. Research in this area will involve investigating more complex gene expression mechanisms, the use of logic and attribute grammars, and dynamic grammar modification.

o Output Code in an Arbitrary Language - As the grammar in the GPM is a plug-in component like the search algorithm we can generate code in any language.

Home|Features|Publications|People|Related Links|Contact Us

Maintained by Michael O'Neill