%0 Generic
%D 2010
%T Depth-first Search with P Systems
%A Miguel A. Gutiérrez-Naranjo
%A Mario J. Pérez-Jiménez
%E Marian Gheorghe
%E Thomas Hinze
%E Gheorghe Paun
%C Jena, Germany
%I Pro BUSINESS GmbH
%P 257-267
%S Proceedings of the Eleventh International Conference on Membrane Computing (CMC11)
%U http://cmc11.uni-jena.de/proceedings/gutierrez.pdf
%X The usual way to find a solution for an NP complete problem with Membrane Computing techniques is by brute force algorithms where all the feasible solutions are generated and they are checked simultaneously by using massive parallelism. 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.
%8 August 2010
%@ 978-3-86805-721-8