<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Miguel A. Gutiérrez-Naranjo</style></author><author><style face="normal" font="default" size="100%">Mario J. Pérez-Jiménez</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Marian Gheorghe</style></author><author><style face="normal" font="default" size="100%">Thomas Hinze</style></author><author><style face="normal" font="default" size="100%">Gheorghe Paun</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Depth-first Search with P Systems</style></title><secondary-title><style face="normal" font="default" size="100%">Eleventh International Conference on Membrane Computing (CMC11)</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Proceedings of the Eleventh International Conference on Membrane Computing (CMC11)</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year><pub-dates><date><style  face="normal" font="default" size="100%">August 2010</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://cmc11.uni-jena.de/proceedings/gutierrez.pdf</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Pro BUSINESS GmbH</style></publisher><pub-location><style face="normal" font="default" size="100%">Jena, Germany</style></pub-location><pages><style face="normal" font="default" size="100%">257-267 </style></pages><isbn><style face="normal" font="default" size="100%">978-3-86805-721-8</style></isbn><abstract><style face="normal" font="default" size="100%">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.</style></abstract></record></records></xml>