In the framework of Membrane Computing, several efficient solutions to computationally hard problems have been given. To ...

In Membrane Computing, diferent variants of devices can be found by changing both syntactical and semantic ingredients. ...

Methods for optimizing and evolving spiking neural P systems (in short, SN P systems) have been previously developed with ...

P systems are computing devices based on sets of rules that dictate how they work. While some of these rules can change ...

Membrane computing is a massively parallel and non-deterministic bioinspired computing paradigm whose models are called P ...

A mobile robot acting in a human environment should follow social conventions, keeping safety distances and navigating at ...

A widely studied field in the framework of membrane computing is computational complexity theory. While some types of P ...

To date, parallel simulation algorithms for spiking neural P (SNP) systems are based on a matrix representation. This way, ...

Over the last few years, a new methodology to address the P versus NP problem has been developed, based on searching ...

Dendrite P systems (DeP systems) are a recently introduced neural-like model of computation. They provide an alternative ...

From the creation of the field of Membrane Computing in 1998, several research lines havebeen opened. On the one hand, ...

Nature-inspired computing is a type of human-designed computing motivated by nature, which is based on the employ of ...

P systems with active membranes are a class of computation models in the area ofmembrane computing, which are inspired ...

Population Dynamics P systems is a modelling framework that have been used successfully for some important real ecosystems. ...

In the Membrane Computing area, P systems are unconventional devices of computation inspired by the structure and processes ...

Cell-like P systems with symport/antiport rules are computing models inspired by theconservation law, in the sense that ...

Psystems with active membranes is one of the most studied models within the field ofMembrane Computing. Simulating the ...

In the framework of membrane computing, several frontiers of e ciency have been found with respect to the resources that ...

Presumably efficient computing models are characterized by their capability to provide polynomial-time solutions for ...

We model the problem of contour approximation using Hilbert's space lling curve, with a novel type of parallel array ...

In 2005, Gh. Păun raised an interesting question concerning the role of electrical charges in P systems with active membranes ...

Cooperation is doubtless a relevant ingredient on rewriting rules based computing models. This paper provides an overview on ...

Membrane computing is a bio-inspired computing paradigm that lacks in vivo implementation. That is why software or hardware ...

A single Turing machine can solve decision problems with an in nite number of instances. On the other hand, in the framework ...

First, the dependency graph technique, not so far from its current application, was developed trying to nd the shortest ...

In 2008, P-Lingua was born. The Research Group on Natural Computing worked on the development of simulation tools since ...

The tape of a deterministic Turing machine contains an unbounded number of cells. Thanks to that, a single machine can ...

The search for effcient solutions of computationally hard problems by means of families of membrane systems has lead to a ...

The search for new mechanisms and tools allowing us to tackle the famousPversusNPproblem from new perspectives is an ...

P-Lingua is a software framework for Membrane Computing, it includes a programming language, also called P-Lingua, for ...

The dependency graph technique was initially thought as a method to find short paths in the computation tree of a membrane ...

Cell-like P systems where communication between the regions are carried out by rules of type symport/antiport are considered. ...

Complexity class DP is the class of “differences” of any two languages in NP. It verifies that NP[ co-NP DP PNP, where ...

In the framework of Membrane Computing, several efficient solutions to computationally hard problems have been given. To ...

P systems with active membranes use evolution, communication, dissolution and division(or separation) rules. They do not ...

The (presumed) efficiency of computing models is expressed by means of their ability to solve (NP-complete) presumably ...

Methods based on Rapidly-exploring Random Trees (RRTs) have been widely used in robotics to solve motion planning problems. ...

In order to validate P system models and to assist on their formal verification, simulators are indispensable. Moreover, ...

In the field of Membrane Computing, computational complexity theory has been widely studied trying to nd frontiers of ...

In the framework of Membrane Computing, several tools to tackle the P versus NP problems by means of frontiers of the ...

Many variants of P systems have the ability to generate an exponential number of membranes in linear time. This feature ...

Methods based on Rapidly-exploring Random Trees (RRTs) have been in use in robotics to solve motion planning problems for ...

Modelling real systems and processes is a task classically performed through the approach of di erential equation systems, ...

The factorization problem (given a natural number which is the product of two prime numbers, find its decomposition) is ...

Membrane Computing provides machine-oriented models of computation, with types and variants including different elements ...

A decision problem is one that has a yes/no answer, while a counting problem asks how many possible solutions exist ...

Membrane computing is a computing paradigm providing a class of distributed parallel computing devices of a biochemical ...

From a computational complexity point of view, some syntactical ingredients play differentroles depending on the kind of ...

The P versus NP problem is undoubtedly the most important open question in computer science. Frontiers of tractability or ...

P systems with active membranes is a widely studied framework within the field of Membrane Computing since the creation ...

Membrane computing is a computing paradigm providing a class of distributed parallel computing devices of a biochemical ...

Research interest within membrane computing is becoming increasingly interdisciplinary.In particular, one of the latest ...

Current parallel simulation algorithms for Spiking Neural P (SNP) systems are based on a matrix representation. This helps ...

P systems with active membranes, in their classical definition, make use of noncooperative rules only. However, it is well ...

P systems with active membranes is a well developed framework in the eld of Membrane Computing. Using evolution, ...

This work is about modelling an experiment composed by multiple Stern- Gerlach devices using Membrane Computing. We will ...

Cooperation is doubtless a critical ingredient of a computing model. This paper provides an overview on results showing ...

The main objective of this article is to modelize the process of decay of Uranium within the framework of Membrane ...

Sevilla Carpets have already been used to compare di erent solutions of the Subset Sum problem: either designed in the ...