Browsing Ciencias de la Computación e Inteligencia Artificial by Title
Now showing items 535-554 of 880
-
Article
On a partial affirmative answer for a Paun's Conjecture
(WORLD SCIENTIFIC PUBL CO PTE LTD, 2011)At the beginning of 2005, Gheorghe Pun formulated a conjecture stating that in the framework of recognizer P systems with ...
-
Presentation
On a Paun’s Conjecture in Membrane Systems
(Springer, 2007)We study a P˘aun’s conjecture concerning the unsolvability of NP–complete problems by polarizationless P systems with ...
-
Article
On axiom schemes for T-provably Δ1 formulas
(Springer, 2014)This paper investigates the status of the fragments of Peano Arithmetic obtained by restricting induction, collection and ...
-
Presentation
On Communication Complexity in Evolution-Communication P Systems
(Fénix Editora, 2010)Looking for a theory of communication complexity for P systems, we consider here so-called evolution-communication (EC ...
-
Chapter of Book
On Descriptive Complexity of P Systems
(Springer, 2005)In this paper we address the problem of describing the complexity of the evolution of a P system. This issue is is specially ...
-
Presentation
On Efficiency of P Systems with Symport/Antiport and Membrane Division
(Fenix Editora, 2017)Classical membrane systems with symport/antiport rules observe the con- servation law, in the sense that they compute by ...
-
Chapter of Book
On Experimental Efficiency for Retraction Operator to Stem Basis
(Springer, 2018)In this paper, we introduce an implementation of an inference rule called “Independence Rule” which lets us reduce the ...
-
Presentation
On GPU-Oriented P Systems
(IEEE Computer Society, 2018) -
Chapter of Book
On P Systems as a Modelling Tool for Biological Systems
(Springer, 2006)We introduce a variant of P systems where rules have associated a real number providing a measure for the “intrinsic ...
-
Presentation
On P Systems with Bounded Parallelism
(IEEE Computer Society, 2005)A framework that describes the evolution of P systems with bounded parallelism is de ned by introducing basic formal ...
-
Presentation
On Parallel Array P Systems
(Fénix Editora, 2014)We further investigate the parallel array P systems recently introduced by K.G. Subramanian, P. Isawasan, I. Venkat, and ...
-
Presentation
On Rules and Parameter Free Systems in Bounded Arithmetic
(Springer, 2007)We present model–theoretic techniques to obtain conservation results for first order bounded arithmetic theories, based on a hierarchical version of the well known notion of an existentially closed model.
-
Article
On spiking neural P systems
(Springer, 2010)This work deals with several aspects concerning the formal verification of SN P systems and the computing power of some ...
-
Presentation
On String Languages Generated by Spiking Neural P Systems
(Fénix Editora, 2006)We continue the study of spiking neural P systems by considering these computing devices as binary string generators: the ...
-
Presentation
On the Complexity of Shared Conceptualizations
(Springer, 2012)In the Social Web, folksonomies and other similar knowledge organization techniques may suffer limitations due to both ...
-
Presentation
On the Computational Efficiency of Polarizationless Recognizer P Systems with Strong Division and Dissolution
(Fénix Editora, 2008)Recognizer P systems with active membranes have proven to be very powerful computing devices, being able to solve NP-complete ...
-
Article
On the degree of parallelism in membrane systems
(Elsevier, 2007)In the literature, several designs of P systems might be found for performing the same task. The use of different techniques ...
-
Article
On the design of a framework integrating an optimization engine with streaming technologies
(Elsevier, 2020)A number of streaming technologies have appeared in the last years as a result of the rising of Big Data applications. ...
-
Article
On the efficiency of cell-like and tissue-like recognizing membrane systems
(Wiley, 2009)Cell-like recognizing membrane systems are computational devices in the framework of membrane computing inspired from the ...
-
Article
On the Optimality of Conservation Results for Local Reflection in Arithmetic
(Association for Symbolic Logic, 2013)Let T be a recursively enumerable theory extending Elementary Arithmetic EA. L. D. Beklemishev proved that the Σ2 local ...