Buscar
Mostrando ítems 131-140 de 164
Ponencia
Solving the BINPACKING Problem by Recognizer P Systems with Active Membranes
(Fénix Editora, 2004)
In this paper we present an e®ective solution to the BINPACKING problem using a family of recognizer P systems with active membranes, input membrane and external output. The analysis of the solution presented here will ...
Artículo
Handling Languages with Spiking Neural P Systems with Extended Rules
(Romanian Academy, Section for Information Science and Technology, 2006)
We consider spiking neural P systems with spiking rules allowed to introduce zero, one, or more spikes at the same time. A tool-kit for computing (some) operations with languages generated by such systems is provided. ...
Ponencia
An Approach to the Degree of Parallelism in P Systems
(Fénix Editora, 2006)
In the literature, several designs of P systems were used for performing the same task. The use of different techniques or even different P system models makes it very difficult to compare these designs. In this paper, ...
Capítulo de Libro
On Descriptive Complexity of P Systems
(Springer, 2005)
In this paper we address the problem of describing the complexity of the evolution of a P system. This issue is is specially hard in the case of P systems with active membranes, where the number of steps of a computation ...
Capítulo de Libro
Decision P Systems and the P =NP Conjecture
(Springer, 2003)
We introduce decision P systems, which are a class of P systems with symbol-objects and external output. The main result of the paper is the following: if there exists an NP–complete problem that cannot be solved in ...
Capítulo de Libro
A Study of the Robustness of the EGFR Signalling Cascade Using Continuous Membrane Systems
(Springer, 2005)
Many approaches to anticancer treatment have had a limited success. A fundamental hurdle to cancer therapy is the robustness of the signalling networks involved in tumourgenesis. The complexity of net- works of biological ...
Capítulo de Libro
Solving Knapsack Problems in a Sticker Based Model
(Springer, 2002)
Our main goal in this paper is to give molecular solutions for two NP–complete problems, namely Subset-sum and Knapsack, in a sticker based model for DNA computations. In order to achieve this, we have used a finite set ...
Capítulo de Libro
Using Automated Reasoning Systems on Molecular Computing
(Springer, 2005)
This paper is focused on the interplay between automated reasoning systems (as theoretical and formal devices to study the correctness of a program) and DNA computing (as practical devices to handle DNA strands to solve ...
Capítulo de Libro
A Linear-Time Solution to the Knapsack Problem Using P Systems with Active Membranes
(Springer, 2004)
Up to now, P systems dealing with numerical problems have been rarely considered in the literature. In this paper we present an effective solution to the Knapsack problem using a family of deterministic P systems with ...
Ponencia
Searching Previous Configurations in Membrane Computing
(Springer, 2009)
Searching all the configurations C′ which produce a given configuration C is an extremely hard task. The current approximations are based on heavy hand-made calculus by considering the specific features of the given ...