Buscar
Mostrando ítems 1-10 de 164
Tesis Doctoral
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Especificación y verificación de programas moleculares en PVS
(2003-09-29)
La Computación Molecular y, en concreto, la Computación con ADN, es una disciplina que se enmarca dentro del campo de investigación conocido como Computación Natural. Tiene como objetivo el desarrollo de modelos de computación ...
Ponencia
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
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 ...
Ponencia
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
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 ...
Ponencia
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
On the Computational Efficiency of Polarizationless Recognizer P Systems with Strong Division and Dissolution
(Fénix Editora, 2008)
Recognizer P systems with active membranes have proven to be very powerful computing devices, being able to solve NP-complete decision problems in a polynomial time. However such solutions usually exploit many powerful ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
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
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
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 ...
Capítulo de Libro
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
A MzScheme Implementation of Transition P Systems
(Springer, 2003)
The main goal of this paper is to present the design of an MzScheme program that allows us to simulate the behavior of transition P systems. For that, a library of procedures have been developed that work in two stages. ...
Capítulo de Libro
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Graphical Modeling of Higher Plants Using P Systems
(Springer, 2006)
L systems have been widely used to model and graphically represent the growth of higher plants [20]. In this paper we continue developing the framework introduced in [21], which make use of the topology of membrane ...
Tesis Doctoral
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
P systems, a computational modelling framework for systems biology
(2008-02-06)
LOS PROGRAMAS INFORMÁTICOS QUE MODELIZAN CÉLULAS FACILITARÁN EL TRABAJO DE LOS BIÓLOGOS Se basa en hacer modelos de células, por lo que llevo tres años en los que estoy realizando modelos de sistemas biológicos en bacterias. ...
Ponencia
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Computing Backwards with P Systems
(Fénix Editora, 2009)
Searching all the configurations C′ such that produce a given configuration C, or, in other words, computing backwards in Membrane Computing is an extremely hard task. The current approximations are based in heavy hand-made ...