Developing redundant binary representations for genetic search
This paper considers the development of redundant representations for evolutionary computation. Two new families of redundant binary representations are proposed in the context of a simple mutationselection evolutionary model. The first is a family of linear encodings in which the connectivity of th...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | conferenceObject |
| Idioma: | eng |
| Publicado em: |
2012
|
| Texto completo: | http://hdl.handle.net/10400.1/946 |
| País: | Portugal |
| Oai: | oai:sapientia.ualg.pt:10400.1/946 |