Buscar
Mostrando ítems 1-10 de 37
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
Symport/Antiport P Systems with Three Objects Are Universal
(IOS Press, 2005)
The operations of symport and antiport, directly inspired from biology, are already known to be rather powerful when used in the framework of P systems. In this paper we confirm this observation with a quite surpris- ing ...
Artículo
Spike Trains in Spiking Neural P Systems
(World Scientific, 2006)
We continue here the study of the recently introduced spiking neural P systems, which mimic the way that neurons communicate with each other by means of short electrical impulses, identical in shape (volt- age), but ...
Artículo
Tissue P systems with cell division
(Agora University of Oradea, 2008)
In tissue P systems several cells (elementary membranes) communicate through symport/antiport rules, thus carrying out a computation. We add to such systems the basic feature of (cell–like) P systems with active membranes ...
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 ...
Capítulo de Libro
Computationally Hard Problems Addressed Through P Systems
(Springer, 2006)
In this chapter we present a general framework to provide efficient solutions to decision problems through families of cell-like membrane systems constructed in a semi-uniform way (associating with each instance of the ...
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. ...