Buscar
Mostrando ítems 1-10 de 67
Ponencia
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 ...
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 ...
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 ...
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 ...
Ponencia
Fractals and P Systems
(Fénix Editora, 2006)
In this paper we show that the massive parallelism, the synchronous appli- cation of the rules, and the discrete nature of their computation, among other features, lead us to consider P systems as natural tools for dealing ...
Ponencia
Looking for P Truth
(Fénix Editora, 2004)
In a general sense, Logic studies how to derive new pieces of in- formation from previous ones. In this paper we explore the analogies between P systems, where new configurations can be obtained from previous ones by using ...
Ponencia
Membrane Computing Meets Artificial Intelligence: A Case Study
(Fénix Editora, 2010)
The usual way to find a solution for a NP complete problem with Membrane Computing techniques is by brute force algorithms where all the feasible solutions are generated and they are checked simultaneously by using massive ...
Ponencia
Depth-First Search with P Systems
(Springer, 2011)
The usual way to find a solution for an NP complete problem in Membrane Computing is by brute force algorithms. These solutions work from a theoretical point of view but they are implementable only for small instances of ...
Tesis Doctoral
Programación celular resolución eficiente de problemas numéricos NP-completos
(2004)
Esta memoria está estructurada en capítulos cuyos contenidos pasamos a describir sucintamente. En el Capítulo 1 se hace una breve introducción histórica de la Teoría de la Computabilidad, analizándose las limitaciones ...