Buscar
Mostrando ítems 291-298 de 298
Artículo
How to express tumours using membrane systems
(ELSEVIER SCIENCE INC, 2007)
In this paper we discuss the potential usefulness of membrane systems as tools for modelling tumours. The approach is followed both from a macroscopic and a microscopic point of view. In the first case, one considers the ...
Artículo
Solving SUBSET SUM by Spiking Neural P Systems with Pre-computed Resources
(IOS Press, 2008)
Recently the possibility of using spiking neural P systems for solving computationally hard problems has been considered. Such solutions assume that some (possibly exponentially large) pre-computed resources are given in ...
Artículo
P systems with input in binary form
(WORLD SCIENTIFIC PUBL CO PTE LTD, 2006)
Current P systems which solve NP-complete numerical problems represent the instances of the problems in unary notation. However, in classical complexity theory, based upon Turing machines, switching from binary to unary ...
Capítulo de Libro
Cellular solutions to some numerical NP-complete problems: A prolog implementation
(Idea Group Inc., 2005)
This chapter is devoted to the study of numerical NP-complete problems in the framework of cellular systems with membranes, also called P systems (Pǎun, 1998). The chapter presents efficient solutions to the subset sum and ...
Ponencia
Multidimensional descriptional complexity of P systems
(Univ. degli Studi di Milano, 2005)
Membrane Computing is a branch of Natural Computing which starts from the assumption that the processes taking place in the compartmental structure of a living cell can be interpreted as computations. The description of ...
Ponencia
P Systems with Membrane Creation and Rule Input
(Fénix Editora, 2005)
When a uniform family of recognizer P systems is designed to solve a problem, the data of a concrete instance of the problem is usually provided via a multiset which is placed in the so-called input membrane. In this paper ...
Ponencia
Converting Integer Numbers from Binary to Unary Notation with P Systems
(Fénix Editora, 2005)
Current P systems which solve NP–complete numerical problems represent instances in unary notation. In classical complexity theory, based upon Turing machines, switching from binary to unary encoded instances gen erally ...
Ponencia
Multidimensional Sevilla carpets Associated with P Systems
(Fénix Editora, 2005)
In this paper we address the problem of describing the complexity of the evolution of a P system. This is especially difficult in the case of P systems where the number of membranes in creases along the computation, via ...