Buscar
Mostrando ítems 11-20 de 22
Ponencia
Minimal Cooperation in P Systems with Symport/Antiport: A Complexity Approach
(Fénix Editora, 2015)
Membrane systems with symport/antiport rules compute by just moving objects among membranes, and not by changing the objects themselves. In these systems the environment plays an active role because, not only it receives ...
Ponencia
Asynchronous Spiking Neural P Systems with Structural Plasticity
(Fénix Editora, 2015)
Spiking neural P (in short, SNP) systems are computing devices inspired by biological spiking neurons. In this work we consider SNP systems with structural plasticity (in short, SNPSP systems) working in the asynchronous ...
Ponencia
Computational Efficiency of P Systems with Symport/Antiport Rules and Membrane Separation
(Fénix Editora, 2015)
Membrane ssion is a process by which a biological membrane is split into two new ones in such a way that the contents of the initial membrane is separated and distributed between the new membranes. Inspired by this ...
Ponencia
On The Semantics of Annihilation Rules in Membrane Computing
(Fénix Editora, 2015)
It is well known that polarizationless recognizer P systems with active membranes, without dissolution, with division of elementary and non-elementary membranes, with antimatter and matter/antimatter annihilation rules ...
Ponencia
Self-constructing Recognizer P Systems
(Fénix Editora, 2014)
Usually, the changes produced in the membrane structure of a P system are considered side effects. The output of the computation is encoded as a multiset placed in a specific region and the membrane structure in the ...
Ponencia
Antimatter as a Frontier of Tractability in Membrane Computing
(Fénix Editora, 2014)
It is well known that the polynomial complexity class of recognizer polarizationless P systems with active membranes, without dissolution and with division for elementary and non-elementary membranes is exactly the ...
Ponencia
Solving the ST-Connectivity Problem with Pure Membrane Computing Techniques
(Fénix Editora, 2014)
In Membrane Computing, the solution of a decision problem X belonging to the complexity class P via a polynomially uniform family of recognizer P systems is trivial, since the polynomial encoding of the input can involve ...
Ponencia
Limits on P Systems with Proteins and Without Division
(Universidad de Sevilla, Escuela Técnica Superior de Ingeniería Informática, 2018)
In the field of Membrane Computing, computational complexity theory has been widely studied trying to nd frontiers of efficiency by means of syntactic or semantical ingredients. The objective of this is to nd two kinds ...
Ponencia
Kernel P Systems - Version 1
(Fénix Editora, 2013)
A basic P system, called kernel P system4 (kP system for short), combining features of di erent P systems introduced and studied so far is de ned and discussed. The structure of such systems is de ned as a dynamic graph, ...
Ponencia
Simulating a Family of Tissue P Systems Solving SAT on the GPU
(Fénix Editora, 2013)
In order to provide e cient software tools to deal with large membrane systems, high-throughput simulators are required. Parallel computing platforms are good candidates, since they are capable of partially implementing ...