Buscar
Mostrando ítems 11-20 de 298
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 ...
Tesis Doctoral
Operadores de generalización para el aprendizaje clausal
(2002)
"En esta memoria hemos estudiado los procesos de generalización, el paso de lo particular a lo general, cuando la información está expresada en lenguaje clausal. Para ello hemos definido unos operadores adaptados a los ...
Capítulo de Libro
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
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
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
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 ...
Artículo
Symport/Antiport P Systems with Three Objects Are Universal
(IOS Press, 2005)
The operations of symport and antiport, directly inspired from biology, are already known to be rather powerful when used in the framework of P systems. In this paper we confirm this observation with a quite surpris- ing ...
Capítulo de Libro
Attacking the Common Algorithmic Problem by Recognizer P Systems
(Springer, 2005)
Many NP-complete problems can be viewed as special cases of the Common Algorithmic Problem (CAP). In a precise sense, which will be defined in the paper, one may say that CAP has a property of local universality. In ...
Artículo
Fragments of Arithmetic and true sentences
(Wiley, 2005)
By a theorem of R. Kaye, J. Paris and C. Dimitracopoulos, the class of the ¦n+1–sentences true in the standard model is the only (up to deductive equivalence) consistent ¦n+1–theory which extends the scheme of induction ...