Buscar
Mostrando ítems 211-220 de 411
Ponencia
An apparently innocent problem in Membrane Computing
(Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla, 2019)
The search for effcient solutions of computationally hard problems by means of families of membrane systems has lead to a wide and prosperous eld of research. The study of computational complexity theory in Membrane ...
Artículo
Comparing simulation algorithms for multienvironment probabilistic P systems over a standard virtual ecosystem
(Springer, 2012)
Membrane Computing has recently proved to be a suitable framework for addressing the modelling of dynamical biological systems in general, and ecosystems in particular. Due to the inherent randomness and uncertainty in ...
Ponencia
Uniform Solution to QSAT Using Polarizationless Active Membranes
(Fénix Editora, 2006)
It is known that the satisfiability problem (SAT) can be solved a semi- uniform family of deterministic polarizationless P systems with active membranes with non-elementary membrane division. We present a double improvement ...
Ponencia
P Systems based Computing Polynomials: Design and Formal Verification
(IMCS: International Membrane Computing Society, 2015)
Automatic design of P systems is an attractive research topic in the community of membrane computing. Differing from the previous work that used evolutionary algorithms to fulfill the task, this paper presents the design ...
Ponencia
Towards a Programming Language in Cellular Computing
(Fénix Editora, 2004)
Several solutions to hard numerical problems using P systems have been presented recently, and strong similarities in their designs have been no- ticed. In this paper we present a new solution, an e®ective one to the ...
Ponencia
On a Paun’s Conjecture in Membrane Systems
(Springer, 2007)
We study a P˘aun’s conjecture concerning the unsolvability of NP–complete problems by polarizationless P systems with active membranes in the usual framework, without cooperation, without priorities, without changing ...
Artículo
Computational complexity of tissue-like P systems
(Elsevier, 2010)
Ponencia
On GPU-Oriented P Systems
(IEEE Computer Society, 2018)
Capítulo de Libro
Specification of Adleman’s Restricted Model Using an Automated Reasoning System: Verification of Lipton’s Experiment
(Springer, 2002)
The aim ofthis paper is to develop an executable prototype ofan unconventional model ofcomputation. Using the PVS verification system (an interactive environment for writing formal specifications and checking formal ...
Artículo
Complexity Perspectives on Minimal Cooperation in Cell-like Membrane Systems
(IMCS: International Membrane Computing Society, 2016)
Cooperation is doubtless a critical ingredient of a computing model. This paper provides an overview on results showing how forbidding cooperation, or allowing it only a minimum degree, influences the computing power. In ...