Buscar
Mostrando ítems 11-20 de 24
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
P–Lingua 2.0: A software framework for cell–like P systems
(Agora University of Oradea, Romania, 2009)
P-Lingua is a programming language for membrane computing. It was first presented in Edinburgh, during the Ninth Workshop on Membrane Computing (WMC9). In this paper, the models, simulators and formats included in P-Lingua ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Modeling Logic Gene Networks by Means of Probabilistic Dynamic P Systems
(Old City Publishing, 2013)
Gene regulatory networks are useful models for biologists to understand the interactions among genes in living organisms. In this work, we consider a special class of gene regulatory networks, called logical networks, ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Spiking Neural P systems with several types of spikes
(Agora University of Oradea, 2011)
With a motivation related to gene expression, where enzymes act in series, somewhat similar to the train spikes traveling along the axons of neurons, we consider an extension of spiking neural P systems, where several ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
A computational modeling for real ecosystems based on P systems
(Springer, 2011)
In this paper, a P systems based general framework for modeling ecosystems dynamics is presented. Particularly, ecosystems are specified by means of multienvironment P systems composed of a finite number of environments, ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Efficient simulation of tissue-like P systems by transition cell-like P systems
(Springer, 2009)
In the framework of P systems, it is known that the construction of exponential number of objects in polynomial time is not enough to efficiently solve NP-complete problems. Nonetheless, it could be sufficient to create ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Logic Negation with Spiking Neural P Systems
(Springer, 2020)
Nowadays, the success of neural networks as reasoning systems is doubtless. Nonetheless, one of the drawbacks of such reasoning systems is that they work as black-boxes and the acquired knowledge is not human readable. ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Time-free solution to SAT problem using P systems with active membranes
(Elsevier, 2014)
P systems are a class of distributed and parallel computation models inspired by the structure and the functioning of living cells. P systems have been used to solve computation hard problems, where the execution of each ...
Ponencia
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Analysis of P systems simulation on CUDA
(SARTECO: Sociedad de Arquitectura y Tecnología de Computadores, 2009)
GPUs (Graphics Processing Unit) have been con- solidated as a massively data-parallel coprocessor to develop many general purpose computations, and en- able developers to utilize several levels of parallelism to obtain ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
The role of integral membrane proteins in computational complexity theory
(Springer, 2018)
In the framework of Membrane Computing, several tools to tackle the P versus NP problems by means of frontiers of the efficiency expressed in terms of syntactic or semantic ingredients, have been developed. In this paper, ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
A Formalization of Transition P Systems
(IOS Press, 2002)
In this paper we give a complete formalization of a new computability model of a distributed parallel type which is inspired by some basic features of living cells: transition P systems as they were given in [3], addressed ...