Search
Now showing items 1-6 of 6
Presentation
Simulation of Computing P Systems: A GPU Design for the Factorization Problem
(Friedrich-Schiller-Universität Jena, 2018)
Presentation
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 ...
Presentation
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 ...
Presentation
P-Lingua Compiler: A Tool for Generating Ad-hoc Simulators in Membrane Computing
(Centre for Discrete Mathematics and Theoretical Computer Science, 2018)
Presentation
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 ...
Presentation
Robot Path Planning using Rapidly-Exploring Random Trees: A Membrane Computing Approach
(IEEE Computer Society, 2018)
Methods based on Rapidly-exploring Random Trees (RRTs) have been in use in robotics to solve motion planning problems for nearly two decades. On the other hand, in the membrane computing framework, models based on ...