Buscar
Mostrando ítems 1-9 de 9
Ponencia
Simulation of Computing P Systems: A GPU Design for the Factorization Problem
(Friedrich-Schiller-Universität Jena, 2018)
Artículo
Adaptative parallel simulators for bioinspired computing models
(Elsevier, 2020)
In the Membrane Computing area, P systems are unconventional devices of computation inspired by the structure and processes taking place in living cells. Main successful P system applications lie in computability and ...
Ponencia
Solving the feasibility problem in robotic motion planning by means of Enzymatic Numerical P systems
(IMCS: International Membrane Computing Society, 2019)
Solving the feasibility problem in robotic motion planning means to find feasible trajectories for specific mobile robots acting in environments with obstacles whose positions are known a priori. The Rapidly-exploring ...
Artículo
An Overview of Hardware Implementation of Membrane Computing Models
(ACM Digital Library, 2020)
The model of membrane computing, also known under the name of P systems, is a bio-inspired large-scale parallel computing paradigm having a good potential for the design of massively parallel algorithms. For its implementation ...
Ponencia
11 years of P-Lingua: A backward glance
(Editura BIBLIOSTAR, 2019)
In 2008, P-Lingua was born. The Research Group on Natural Computing worked on the development of simulation tools since the beginning of Membrane Computing. However, back in 2007, researchers from the group set out to ...
Artículo
Dendrite P Systems Toolbox: Representation, Algorithms and Simulators
(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 ...
Artículo
The role of integral membrane proteins in computational complexity theory
(Springer, 2018)
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, ...
Artículo
From NP-Completeness to DP-Completeness: A Membrane Computing Perspective
(Hindawi, 2020)
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 ...
Artículo
A membrane parallel rapidly-exploring random tree algorithm for robotic motion planning
(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 ...