Buscar
Mostrando ítems 51-60 de 177
Ponencia
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Simulation of Recognizer P Systems by Using Manycore GPUs
(Fénix Editora, 2009)
Software development for cellular computing is growing up yielding new applications. In this paper, we describe a simulator for the class of recognizer P systems with active membranes, which exploits the massively parallel ...
Ponencia
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
On a Class of P Automata as a Machine Model for Languages over Infinite Alphabets
(Fénix Editora, 2005)
We show how P automata having a finite description and working with a finite object-alphabet can be used to describe languages over countably infinite alphabets. We propose to relate the language classes characterized ...
Ponencia
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Dictionary Search and Update by P Systems with String-Objects and Active Membranes
(Fénix Editora, 2009)
Membrane computing is a formal framework of distributed parallel computing. In this paper we implement working with the prefix tree by P systems with strings and active membranes.
Ponencia
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
A Java Simulator for Basic Transition P Systems
(Fénix Editora, 2004)
In this paper, a software tool (called SimCM, from Spanish Sim- ulador de Computaci¶on con Membranas) for handling P systems is presented. The program can simulate basic transition P Systems where dissolution of membranes ...
Ponencia
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Size and Power of Extended Gemmating P Pystems
(Fénix Editora, 2004)
In P systems with gemmation of mobile membranes were ex- amined. It was shown that (extended) systems with eight membranes are as powerful as the Turing machines. Moreover, it was also proved that extended gemmating P ...
Ponencia
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Metabolic Algorithm with Time-varying Reaction Maps
(Fénix Editora, 2005)
A symbolic-based approach to modelling biochemical processes and cellular dynamics is likely to turn useful in computational biology, where attempts to represent the cell as a huge, complex dynamic system must trade with ...
Ponencia
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Characterizing the Aperiodicity of Irreducible Markov Chains by Using P Systems
(Fénix Editora, 2009)
It is well known that any irreducible and aperiodic Markov chain has exactly one stationary distribution, and for any arbitrary initial distribution, the sequence of distributions at time n converges to the stationary ...
Ponencia
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
P Systems with Antiport Rules for Evolution Rules
(Fénix Editora, 2004)
We investigate a variant of evolution-communication P systems where the computation is performed in two substeps. First, all possible an- tiport rules are applied in a non-deterministic, maximally parallel way, ...
Ponencia
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Performing Arithmetic Operations with Spiking Neural P Systems
(Fénix Editora, 2009)
We consider spiking neural P systems as devices which can be used to perform some basic arithmetic operations, namely addition, subtraction, comparison and multiplication by a fixed factor. The input to these systems are ...
Ponencia
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
A Tool for Using the SBML Format to Represent P Systems which Model Biological Reaction Networks
(Fénix Editora, 2005)
In this paper we present a software tool to represent P systems modelling signalling networks of biochemical reactions using SBML (Systems Biology Markup Language), a machine-readable format for describing qualitative and ...