Solving complex problems with a bioinspired model

Arteta Albert, Alberto, Gómez Blas, Nuria ORCID: https://orcid.org/0000-0001-5065-3745 and Mingo López, Luis Fernando de (2011). Solving complex problems with a bioinspired model. "Engineering Applications of Artificial Intelligence", v. 29 (n. 6); pp. 919-927. ISSN 0952-1976. https://doi.org/10.1016/j.engappai.2011.03.007.

Descripción

Título: Solving complex problems with a bioinspired model
Autor/es:
Tipo de Documento: Artículo
Título de Revista/Publicación: Engineering Applications of Artificial Intelligence
Fecha: 2011
ISSN: 0952-1976
Volumen: 29
Número: 6
Materias:
ODS:
Palabras Clave Informales: P-systems; Membrane computing; Natural computing; Evolution rules application; Redundant rules; Fast linear algorithms
Escuela: E.U. de Informática (UPM) [antigua denominación]
Departamento: Matemática Aplicada
Licencias Creative Commons: Reconocimiento - Sin obra derivada - No comercial

Texto completo

[thumbnail of INVE_MEM_2011_106457.pdf]
Vista Previa
PDF (Portable Document Format) - Se necesita un visor de ficheros PDF, como GSview, Xpdf o Adobe Acrobat Reader
Descargar (1MB) | Vista Previa

Resumen

Membrane systems are parallel and bioinspired systems which simulate membranes behavior when processing information. As a part of unconventional computing, P-systems are proven to be effective in solvingcomplexproblems.
A software technique is presented here that obtain good results when dealing with such problems. The rules application phase is studied and updated accordingly to obtain the desired results. Certain rules are candidate to be eliminated which can make the model improving in terms of time.

Más información

ID de Registro: 11685
Identificador DC: https://oa.upm.es/11685/
Identificador OAI: oai:oa.upm.es:11685
URL Portal Científico: https://portalcientifico.upm.es/es/ipublic/item/5486303
Identificador DOI: 10.1016/j.engappai.2011.03.007
URL Oficial: http://www.sciencedirect.com/science/article/pii/S...
Depositado por: Memoria Investigacion
Depositado el: 22 Nov 2012 12:42
Ultima Modificación: 12 Nov 2025 00:00