Buscar
Mostrando ítems 31-40 de 360
Artículo
Computing Homology Groups in Binary 2D Imagery by Tissue-like P Systems
(Romanian Academy, Section for Information Science and Technology, 2010)
We present a new solution for the Homology Groups of Binary 2D Image (HGB2I) Problem by using Membrane Computing techniques. This is a classical problem in Homology Theory which tries to calculate the number of connected ...
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 ...
Artículo
Optimal multi-level thresholding with membrane computing
(Elsevier, 2015)
The conventional methods are not effective and efficient for image multi-level thresholding due to time-consuming and expensive computation cost. The multi-level thresholding problem can be posed as anoptimization problem, ...
Artículo
An Overview of Hardware Implementations of P Systems
(ACM Digital Library, 2020)
Implementing the P systems on parallel hardware is a research highlight in bio-inspired computing since the membrane computing is a large-scale parallel computing paradigm which have a potential to tremendously speed ...
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
Cell-Like P Systems With Channel States and Symport/Antiport Rules
(IEEE Computer Society, 2016)
Cell-like P systems with symport/antiport rules are inspired by the structure of a cell and the way of communicating substances through membrane channels between neighboring regions. In this work, channel states are ...
Artículo
Some Results on LΔ n+1
(Wiley, 2001)
We study the quantifier complexity and the relative strength of some fragments of arithmetic axiomatized by induction and minimization schemes for Δn+1 formulas.
Artículo
Spike Trains in Spiking Neural P Systems
(World Scientific, 2006)
We continue here the study of the recently introduced spiking neural P systems, which mimic the way that neurons communicate with each other by means of short electrical impulses, identical in shape (volt- age), but ...
Artículo
Artículo
Representative Datasets: The Perceptron Case
(Cornell University, 2019)
One of the main drawbacks of the practical use of neural networks is the long time needed in the training process. Such training process consists in an iterative change of parameters trying to minimize a loss function. ...