Now showing items 291-300 of 303
Spiking neural P systems with inhibitory rules [Article]
Motivated by the mechanism of inhibitory synapses, a new kind of spiking neural P (SNP) system rules, called inhibitory rules, is introduced in this paper. Based on this, a new variant of SNP systems is proposed, called ...
A membrane parallel rapidly-exploring random tree algorithm for robotic motion planning [Article]
(IOS Press, 2020)
In recent years, incremental sampling-based motion planning algorithms have been widely used to solve robot motion planning problems in high-dimensional configuration spaces. In particular, the Rapidly-exploring Random ...
From NP-Completeness to DP-Completeness: A Membrane Computing Perspective [Article]
Presumably efficient computing models are characterized by their capability to provide polynomial-time solutions for NPcomplete problems. Given a classRof recognizer membrane systems,Rdenotes the set of decision problems ...
Evolutionary response of a native butterfly to concurrent plantinvasions: Simulation of population dynamics [Article]
The habitat of the green-veined white butterfly Pieris oleracea in eastern North America has undergone invasions by the exotic plant garlic mustard (Alliaria petiolata), which is replacing native hosts of P. oleracea such ...
Dendrite P Systems Toolbox: Representation, Algorithms and Simulators [Article]
(World Scientific, 2021)
Dendrite P systems (DeP systems) are a recently introduced neural-like model of computation. They provide an alternative to the more classical spiking neural (SN) P systems. In this paper, we present the first software ...
A P-Lingua based Simulator for Tissue P Systems with Cell Separation [Article]
(Romanian Academy, Section for Information Science and Technology, 2014)
Tissue P systems are one of the currently active research topics within the field of Membrane Computing. In particular, their computational efficiency is being investigated in the case when the number of cells can grow ...
The role of integral membrane proteins in computational complexity theory [Article]
In the framework of Membrane Computing, several tools to tackle the P versus NP problems by means of frontiers of the efficiency expressed in terms of syntactic or semantic ingredients, have been developed. In this paper, ...
Sobre ciertas expresiones de la función rango, independientes de la teoría de ordinales [Presentation]
(Universitat Autónoma de Barcelona, 1980)
In the present work we obtain several representations of the rank func- tion associated to a well founded relation in terms of transitive and supertransitive closures, by means of transfinite recursion theorems con- cerning ...
Enhancing the simulation of P systems for the SAT problem on GPUs [Presentation]
(National Center for Supercomputing Applications, 2010)
GPUs constitute nowadays a solid alternative for high performance computing, and the advent of CUDA/OpenCL allow programmers a friendly model to accelerate a broad range of applications. The way GPUs exploit parallelism ...
Simulation of Computing P Systems: A GPU Design for the Factorization Problem [Presentation]
(Friedrich-Schiller-Universität Jena, 2018)