Buscar
Mostrando ítems 1-10 de 12
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 ...
Artículo
P‑Lingua in two steps: flexibility and efficiency
(Springer, 2019)
Membrane computing is a bio-inspired computing paradigm that lacks in vivo implementation. That is why software or hardware implementations have to be used to validate models. Several tools have been created for this ...
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 ...
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 ...
Ponencia
P-Lingua Compiler: A Tool for Generating Ad-hoc Simulators in Membrane Computing
(Centre for Discrete Mathematics and Theoretical Computer Science, 2018)
Artículo
Simulation of Rapidly-Exploring Random Trees in Membrane Computing with P-Lingua and Automatic Programming
(Agora University of Oradea, 2018)
Methods based on Rapidly-exploring Random Trees (RRTs) have been widely used in robotics to solve motion planning problems. On the other hand, in the membrane computing framework, models based on Enzymatic Numerical P ...
Ponencia
Dependency Graph Technique Revisited
(IMCS: International Membrane Computing Society, 2019)
The dependency graph technique was initially thought as a method to find short paths in the computation tree of a membrane system using weak metrics. It could be used to obtain reasonably fast SAT-solvers, capable of ...
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 ...