Buscar
Mostrando ítems 1-8 de 8
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
Computationally Hard Problems Addressed Through P Systems
(Springer, 2006)
In this chapter we present a general framework to provide efficient solutions to decision problems through families of cell-like membrane systems constructed in a semi-uniform way (associating with each instance of the ...
Capítulo de Libro
Implementing in Prolog an Effective Cellular Solution to the Knapsack Problem
(Springer, 2004)
In this paper we present an implementation in Prolog of an effective solution to the Knapsack problem via a family of deterministic P systems with active membranes using 2-division.
Capítulo de Libro
Formal Verification of Programs in Molecular Models with Random Access Memory
(Fénix Editorial, 2005)
Formal verification of molecular programs is a first step towards their automatic processing by means of reasoning systems (ACL2, PVS, etc). In this paper a systematic method to establish verifications of these programs ...
Capítulo de Libro
Hybrid Networks of Evolutionary Processors
(Springer, 2003)
A hybrid network of evolutionary processors consists of several processors which are placed in nodes of a virtual graph and can perform one simple operation only on the words existing in that node in accordance with ...
Capítulo de Libro
The P Versus NP Problem Through Cellular Computing with Membranes
(Springer, 2004)
We study the P versus NP problem through membrane systems. Language accepting P systems are introduced as a framework allowing us to obtain a characterization of the P = NP relation by the polynomial time unsolvability ...
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
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 ...