Buscar
Mostrando ítems 1-10 de 110
Ponencia
Descriptional Complexity of Tissue-Like P Systems with Cell Division
(Springer, 2009)
In this paper we address the problem of describing the complexity of the evolution of a tissue-like P system with cell division. In the computations of such systems the number of (parallel) steps is not sufficient to ...
Artículo
Minimal cooperation as a way to achieve the efficiency in cell-like membrane systems
(Springer, 2019)
Cooperation is doubtless a relevant ingredient on rewriting rules based computing models. This paper provides an overview on both classical and newest results studying how cooperation among objects influences the ability ...
Ponencia
P Systems with Tables of Rules
(Fénix Editora, 2004)
In the last time, several e®orts were made in order to remove the polarization of membranes from P systems with active membranes; the present paper is a contribution in this respect. In order to compensate the loss of ...
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 ...
Ponencia
Simulation of Computing P Systems: A GPU Design for the Factorization Problem
(Friedrich-Schiller-Universität Jena, 2018)
Artículo
An unsupervised learning algorithm for membrane computing
(Elsevier, 2015)
This paper focuses on the unsupervised learning problem within membrane computing, and proposes an innovative solution inspired by membrane computing techniques, the fuzzy membrane clustering algorithm. An evolution–co ...
Artículo
The Unique Satisfiability Problem from a Membrane Computing Perspective
(Romanian Academy, Section for Information Science and Technology, 2018)
Complexity class DP is the class of “differences” of any two languages in NP. It verifies that NP[ co-NP DP PNP, where PNP is the second level of the polynomial hierarchy, specifically, it is the class of languages ...
Ponencia
Computing Partial Recursive Functions by Virus Machines
(Springer, 2015)
Virus Machines are a computational paradigm inspired by the manner in which viruses replicate and transmit from one host cell to another. This paradigm provides non-deterministic sequential devices. Non-restricted Virus ...
Tesis Doctoral
Programación celular resolución eficiente de problemas numéricos NP-completos
(2004)
Esta memoria está estructurada en capítulos cuyos contenidos pasamos a describir sucintamente. En el Capítulo 1 se hace una breve introducción histórica de la Teoría de la Computabilidad, analizándose las limitaciones ...