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 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. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Gutiérrez-Naranjo, M. A., & Pérez-Jiménez, M. J. (2010). Depth-first search with P systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6501 LNCS, pp. 257–264). Springer Verlag. https://doi.org/10.1007/978-3-642-18123-8_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
