Buscar
Mostrando ítems 31-40 de 55
Ponencia
A Membrane Computing Model for Ballistic Depositions
(Fénix Editora, 2007)
Ballistic Deposition was proposed by Vold and Sutherland as a model for colloidal aggregation. These early works were later extended to simulate the process of vapor deposition. In general, Ballistic Deposition models ...
Ponencia
Self-constructing Recognizer P Systems
(Fénix Editora, 2014)
Usually, the changes produced in the membrane structure of a P system are considered side effects. The output of the computation is encoded as a multiset placed in a specific region and the membrane structure in the ...
Ponencia
Antimatter as a Frontier of Tractability in Membrane Computing
(Fénix Editora, 2014)
It is well known that the polynomial complexity class of recognizer polarizationless P systems with active membranes, without dissolution and with division for elementary and non-elementary membranes is exactly the ...
Libro
Ponencia
Solving the ST-Connectivity Problem with Pure Membrane Computing Techniques
(Fénix Editora, 2014)
In Membrane Computing, the solution of a decision problem X belonging to the complexity class P via a polynomially uniform family of recognizer P systems is trivial, since the polynomial encoding of the input can involve ...
Ponencia
Solving the N-Queens Puzzle with P Systems
(Fénix Editora, 2009)
The N-queens puzzle consists on placing N queens on an N x Ngrid in such way that no two queens are on the same row, column or diagonal line. In this paper we present a family of P systems with active membranes (one P ...
Ponencia
Designing Tissue-like P Systems for Image Segmentation on Parallel Architectures
(Fénix Editora, 2011)
Problems associated with the treatment of digital images have several interesting features from a bio-inspired point of view. One of them is that they can be suitable for parallel processing, since the same sequential ...
Ponencia
Weak Metrics on Configurations of a P System
(Fénix Editora, 2004)
The evolution of a P system generates a tree of computation po- tentially in¯nite where it is very difficult to set the degree of closeness between two configurations. The problem is specially hard if we want to quantify ...
Ponencia
A Case Study in (Mem)Brane Computation: Generating {n2 | n 1}
(Fénix Editora, 2006)
The aim of this paper is to start an investigation and a comparison of the expressiveness of the two most relevant formalisms inspired by membranes interactions, namely, P systems and Brane Calculi. We compare the two ...
Ponencia
Solving Numerical NP-complete Problems by Spiking Neural P Systems with Pre–computed Resources
(Fénix Editora, 2008)
Recently we have considered the possibility of using spiking neural P systems for solving computationally hard problems, under the assumption that some (possibly exponentially large) pre-computed resources are given in ...