Presentation
Depth-First Search with P Systems
Author/s | Gutiérrez Naranjo, Miguel Ángel
![]() ![]() ![]() ![]() ![]() ![]() ![]() Pérez Jiménez, Mario de Jesús ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Department | Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial |
Date | 2011 |
Published in |
|
ISBN/ISSN | 978-3-642-18122-1 0302-9743 |
Abstract | The usual way to find a solution for an NP complete problem in Membrane Computing is by brute force algorithms. These solutions work from a theoretical point of view but they are implementable only for small instances of ... The usual way to find a solution for an NP complete problem in Membrane Computing is by brute force algorithms. These solutions work from a theoretical point of view but they are implementable only for small instances of the problem. In this paper we provide a family of P systems which brings techniques from Artificial Intelligence into Membrane Computing and apply them to solve the N-queens problem. |
Project ID. | TIN2008-04487-E
![]() TIN-2009-13192 ![]() P08-TIC-04200 ![]() |
Citation | Gutiérrez Naranjo, M.Á. y Pérez Jiménez, M.d.J. (2011). Depth-First Search with P Systems. En CMC 2010: 11th International Conference on Membrane Computing (257-264), Jena, Germany: Springer. |
Files | Size | Format | View | Description |
---|---|---|---|---|
978-3-642-18123-8_20.pdf | 219.0Kb | ![]() | View/ | |