Buscar
Mostrando ítems 1-10 de 11
Artículo
The Unique Satisfiability Problem from a Membrane Computing Perspective
(Romanian Academy, Section for Information Science and Technology, 2018)
Complexity class DP is the class of “differences” of any two languages in NP. It verifies that NP[ co-NP DP PNP, where PNP is the second level of the polynomial hierarchy, specifically, it is the class of languages ...
Ponencia
Narrowing Frontiers of Efficiency with Evolutional Communication Rules and Cell Separation
(Universidad de Sevilla, Escuela Técnica Superior de Ingeniería Informática, 2018)
In the framework of Membrane Computing, several efficient solutions to computationally hard problems have been given. To find new borderlines between families of P systems that can solve them and the ones that cannot is ...
Artículo
P systems with symport/antiport rules: When do the surroundings matter?
(Elsevier, 2018-05-01)
Cell-like P systems where communication between the regions are carried out by rules of type symport/antiport are considered. These systems compute by changing the places of objects with respect to the membranes, and not ...
Artículo
P Systems-Based Computing Polynomials With Integer Coefficients: Design and Formal Verification
(IEEE Computer Society, 2018)
Automatic design of mechanical procedures solving abstract problems is a relevant scientific challenge. In particular, automatic design of membranes systems performing some prefixed tasks is an important and useful research ...
Ponencia
A Semantic Frontier of the Efficiency in Membrane Systems
(Centre for Discrete Mathematics and Theoretical Computer Science, 2018)
The (presumed) efficiency of computing models is expressed by means of their ability to solve (NP-complete) presumably intractable problems in an efficient way or not. The relevance of this kind of frontier lies in the ...
Ponencia
Limits on P Systems with Proteins and Without Division
(Universidad de Sevilla, Escuela Técnica Superior de Ingeniería Informática, 2018)
In the field of Membrane Computing, computational complexity theory has been widely studied trying to nd frontiers of efficiency by means of syntactic or semantical ingredients. The objective of this is to nd two kinds ...
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
Fault Diagnosis of Power Systems Using Intuitionistic Fuzzy Spiking Neural P Systems
(IEEE Computer Society, 2018)
In this paper, intuitionistic fuzzy spiking neural P (IFSNP) systems as a variant are proposed by integrating intuitionistic fuzzy logic into original spiking neural P systems. Compared with a common fuzzy set, ...
Artículo
A Decade of Ecological Membrane Computing Applications
(IMCS: International Membrane Computing Society, 2018)
A short summary of recent ecological modelling applications within mem- brane computing developed by the Research Group on Natural Computing (RGNC) is presented here. A timeline of models presented in the last 10 years ...
Ponencia
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 ...