Buscar
Mostrando ítems 11-13 de 13
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
Simulation challenges in membrane computing
(Springer, 2020)
P system simulators are critical tools to enable them as formal modeling framework for real-life applications. Such simulators abstract the concept of P systems in various ways, depending on the needs of the users and the ...
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 ...