Buscar
Mostrando ítems 1-10 de 67
Ponencia
Characterizing Tractability by Tissue-Like P Systems
(Fénix Editora, 2009)
In the framework of cell–like membrane systems it is well known that the construction of exponential number of objects in polynomial time is not enough to efficiently solve NP–complete problems. Nonetheless, it may be ...
Artículo
Spiking neural P systems with extended rules: universality and languages
(Springer, 2008)
We consider spiking neural P systems with rules allowed to introduce zero, one, or more spikes at the same time. The motivation comes both from constructing small universal systems and from generating strings; previous ...
Ponencia
Cell-like Versus Tissue-like P Systems by Means of Sevilla Carpets
(Fénix Editora, 2009)
Sevilla Carpets are a handy tool for comparing computations performed by different systems solving the same problem. Such Sevilla Carpets provide on one hand quantitative information through parameters such as Weight, ...
Artículo
Handling Languages with Spiking Neural P Systems with Extended Rules
(Romanian Academy, Section for Information Science and Technology, 2006)
We consider spiking neural P systems with spiking rules allowed to introduce zero, one, or more spikes at the same time. A tool-kit for computing (some) operations with languages generated by such systems is provided. ...
Ponencia
An Approach to the Degree of Parallelism in P Systems
(Fénix Editora, 2006)
In the literature, several designs of P systems were used 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 paper, ...
Ponencia
The Growth of Branching Structures with P Systems
(Fénix Editora, 2006)
L-systems have been widely used to model and graphically represent the growth of plants. In, the use of membrane computing for such tasks has been proposed. In this paper we present a di®erent approach, which makes use ...
Ponencia
Uniform Solution to QSAT Using Polarizationless Active Membranes
(Fénix Editora, 2006)
It is known that the satisfiability problem (SAT) can be solved a semi- uniform family of deterministic polarizationless P systems with active membranes with non-elementary membrane division. We present a double improvement ...
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
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
A massively parallel framework using P systems and GPUs
(National Center for Supercomputing Applications at the University of Illinois, 2009)
Since CUDA programing model appeared on the general purpose computations, the developers can extract all the power contained in GPUs (Graphics Processing Unit) across many computational domains. Among these domains, P ...