Depth-first search with P systems

Authors:
Miguel A. Gutiérrez-Naranjo;Mario J. Pérez-Jiménez
Affiliations:
Department of Computer Science and Artificial Intelligence, University of Sevilla, Sevilla, Spain;Department of Computer Science and Artificial Intelligence, University of Sevilla, Sevilla, Spain
Venue:
CMC'10 Proceedings of the 11th international conference on Membrane computing
Year:
2010

Citing 4
Cited 0

Artificial Intelligence: A Modern Approach

Artificial Intelligence: A Modern Approach
Complexity classes in models of cellular computing with membranes

Natural Computing: an international journal
A P-Lingua Programming Environment for Membrane Computing

Membrane Computing
A computational complexity theory in membrane computing

WMC'09 Proceedings of the 10th international conference on Membrane Computing

Quantified Score

Hi-index	0.00

Visualization

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.