Buscar
Mostrando ítems 1-10 de 19
Artículo
A uniform family of tissue P systems with cell division solving 3-COL in a linear time
(Elsevier, 2008)
Several examples of the efficiency of cell-like P systems regarding the solution of NPcomplete problems in polynomial time can be found in the literature(obviously, trading space for time). Recently, different new models ...
Artículo
A Framework for Complexity Classes in Membrane Computing
(Elsevier, 2009)
The purpose of the present work is to give a general idea about the existing results and open problems concerning the study of complexity classes within the membrane computing framework. To this aim, membrane systems ...
Artículo
Tissue P systems with channel states
(Elsevier, 2005)
We consider tissue-like P systems with states associated with the links (we call them synapses) between cells, controlling the passage of objects across the links. We investigate the computing power of such devices for ...
Artículo
Solving the Subset-Sum Problem by P Systems with Active Membranes
(Springer, 2005)
We present the first membrance computing solution to the Subset-Sum problem using a family of deterministic P systems with active membranes. We do not use priority among rules, membrane dissolution nor cooperation; it ...
Artículo
On the degree of parallelism in membrane systems
(Elsevier, 2007)
In the literature, several designs of P systems might be found for performing the same task. The use of different techniques or even different P system models makes it very difficult to compare these designs. In this ...
Artículo
P systems with minimal parallelism
(Elsevier, 2007)
A current research topic in membrane computing is to find more realistic P systems from a biological point of view, and one target in this respect is to relax the condition of using the rules in a maximally parallel way. ...
Artículo
Complexity aspects of polarizationless membrane systems
(Springer, 2009)
We investigate polarizationless P systems with active membranes working in maximally parallel manner, which do not make use of evolution or communication rules, in order to find which features are sufficient to efficiently ...
Artículo
P–Lingua 2.0: A software framework for cell–like P systems
(Agora University of Oradea, Romania, 2009)
P-Lingua is a programming language for membrane computing. It was first presented in Edinburgh, during the Ninth Workshop on Membrane Computing (WMC9). In this paper, the models, simulators and formats included in P-Lingua ...
Artículo
A linear-time tissue P system based solution for the 3-coloring problem
(Elsevier, 2007)
In the literature, several examples of the efficiency of cell-like P systems regarding the solution of NPcomplete problems in polynomial time can be found (obviously, trading space for time). Recently, different new ...
Artículo
Membrane Systems with Marked Membranes
(Elsevier, 2007)
Membrane computing is a biologically inspired computational paradigm. Motivated by brane calculi we investigate membrane systems which differ from conventional membrane systems by the following features: (1) biomolecules ...