- -

Accepting networks of genetic processors are computationally complete

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

Accepting networks of genetic processors are computationally complete

Show full item record

Campos Frances, M.; Sempere Luna, JM. (2012). Accepting networks of genetic processors are computationally complete. Theoretical Computer Science. 456:18-29. doi:10.1016/j.tcs.2012.06.028

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/36471

Files in this item

Item Metadata

Title: Accepting networks of genetic processors are computationally complete
Author: Campos Frances, Marcelino Sempere Luna, José María
UPV Unit: Universitat Politècnica de València. Departamento de Sistemas Informáticos y Computación - Departament de Sistemes Informàtics i Computació
Issued date:
Abstract:
We propose a computational model that is inspired by genetic operations over strings such as mutation and crossover. The model, Accepting Network of Genetic Processors, is highly related to previously proposed ones such ...[+]
Subjects: Parallel Genetic Algorithms , Networks of biologically-inspired , Computational completeness
Copyrigths: Cerrado
Source:
Theoretical Computer Science. (issn: 0304-3975 )
DOI: 10.1016/j.tcs.2012.06.028
Publisher:
Elsevier
Publisher version: http://dx.doi.org/10.1016/j.tcs.2012.06.028
Thanks:
Work partially supported by the Spanish Ministry of Science and Innovation under coordinated research project TIN2011-28260-C03-00 and research project TIN2011-28260-C03-01.
Type: Artículo

This item appears in the following Collection(s)

Show full item record