Buscar
Mostrando ítems 1-10 de 10
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
Computational efficiency of dissolution rules in membrane systems
(Taylor and Francis, 2006)
Trading (in polynomial time) space for time in the framework of membrane systems is not sufficient to efficiently solve computationally hard problems. On the one hand, an exponential number of objects generated in ...
Artículo
Computing Homology Groups in Binary 2D Imagery by Tissue-like P Systems
(Romanian Academy, Section for Information Science and Technology, 2010)
We present a new solution for the Homology Groups of Binary 2D Image (HGB2I) Problem by using Membrane Computing techniques. This is a classical problem in Homology Theory which tries to calculate the number of connected ...
Artículo
First Steps Towards a CPU Made of Spiking Neural P Systems
(Agora University of Oradea, Romania, 2009)
We consider spiking neural P systems as devices which can be used to perform some basic arithmetic operations, namely addition, subtraction, comparison and multiplica- tion by a fixed factor. The input to these systems ...
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
On the efficiency of cell-like and tissue-like recognizing membrane systems
(Wiley, 2009)
Cell-like recognizing membrane systems are computational devices in the framework of membrane computing inspired from the structure of living cells, where biological membranes are arranged hierarchically. In this paper ...
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
A software tool for generating graphics by means of P systems
(Springer, 2011-06)
The hand-made graphical representation of the configuration of a P system becomes a hard task when the number of membranes and objects increases. In this paper we present a new software tool, called JPLANT, for computing ...
Artículo
A software tool for verification of Spiking Neural P Systems
(Springer, 2008)
The formal verification of a Spiking Neural P System (SN P Systems, for short) designed for solving a given problem is usually a hard task. Basically, the verification process consists of the search of invariant formulae ...
Artículo
Efficient computation in rational-valued P systems
(Cambridge University Press, 2009)
In this paper, we describe a new representation for deterministic rational-valued P systems that allows us to form a bridge between membrane computing and linear algebra. On the one hand, we prove that an efficient ...