Listar Ciencias de la Computación e Inteligencia Artificial por título
Mostrando ítems 851-870 de 880
-
Ponencia
Uniform Solution to QSAT Using Polarizationless Active Membranes
(Fénix Editora, 2006)It is known that the satisfiability problem (SAT) can be solved a semi- uniform family of deterministic polarizationless ...
-
Artículo
Uniform solutions to SAT and Subset Sum by spiking neural P systems
(Springer, 2009)We continue the investigations concerning the possibility of using spiking neural P systems as a framework for solving ...
-
Ponencia
Universal P Systems: One Catalyst Can Be Suficient
(Fénix Editora, 2013)Whether P systems with only one catalyst can already be universal, is still an open problem. Here we establish universality ...
-
Artículo
Unveiling the underlying molecular basis of astaxanthin accumulation in Haematococcus through integrative metabolomic-transcriptomic analysis
(Elsevier, 2021)Astaxanthin is a valuable and highly demanded ketocarotenoid pigment, for which the chlorophycean microalga Haematococcus ...
-
Ponencia
Uranium- decay chain
(Fénix, 2016)The main objective of this article is to modelize the process of decay of Uranium within the framework of Membrane ...
-
Ponencia
Urban Knowledge Extraction, Representation and Reasoning as a Bridge from Data City towards Smart City
(IEEE Computer Society, 2016)Urban Data management represents a major challenge in the field of Smart Cities. Its understanding is essential for the ...
-
Ponencia
Using A Kernel P System to Solve The 3-Col Problem
(MTA SZTAKI, the Computer and Automation Research Institute of the Hungarian Academy of Sciences, 2012)The newly introduced Kernel P systems offer an unitary and elegant way of integrating established features of existing P ...
-
Ponencia
Using Abstract Stobjs in ACL2 to Compute Matrix Normal Forms
(Springer, 2017)We present here an application of abstract single threaded objects (abstract stobjs) in the ACL2 theorem prover, to define ...
-
Capítulo de Libro
Using Automated Reasoning Systems on Molecular Computing
(Springer, 2005)This paper is focused on the interplay between automated reasoning systems (as theoretical and formal devices to study ...
-
Capítulo de Libro
Using Cognitive Entropy to Manage Uncertain Concepts in Formal Ontologies
(Springer, 2008)A logical formalism to support the insertion of uncertain concepts in formal ontologies is presented. It is based on the ...
-
Ponencia
Using Maude
(Springer, 2000) -
Ponencia
Using Metaheuristic Algorithms Remotely via ROS
(ACM Digital Library, 2007) -
Tesis Doctoral
Verificación de programas en modelos de computación no convencionales
(2002)El objetivo fundamental de esta memoria consiste en desarrollar una primer aproximación a la verificación formal de ...
-
Tesis Doctoral
Verificación formal en ACL2 del Algoritmo de Buchberger
(2003-12-18)En este trabajo se han desarrollado los elementos necesarios para especificar, implementar y verificar la correción del ...
-
Ponencia
Verification in ACL2 of a Generic Framework to Synthesize SAT–Provers
(Springer, 2002)We present in this paper an application of the ACL2 system to reason about propositional satisfiability provers. For that ...
-
Artículo
Verification of the Formal Concept Analysis
(Real Academia de Ciencias, 2004)This paper is concerned with a formal verification of the Formal Concept Analysis framework. We use the PVS system to ...
-
Ponencia
Verified Computer Algebra in ACL2 (Gröbner Bases Computation)
(Springer, 2004)In this paper, we present the formal verification of a Common Lisp implementation of Buchberger’s algorithm for ...
-
Artículo
Verifying a P system generating squares
(Romanian Academy, Section for Information Science and Technology, 2002)In [1], an example of a P system generating exactly all the squares of natural numbers greater than 1 is given. Nevertheless, ...
-
Ponencia
Verifying an Applicative ATP Using Multiset Relations
(Springer, 2001)We present in this paper a formalization of multiset relations in the ACL2 theorem prover [6], and we show how multisets ...
-
Artículo
Verifying the bridge between simplicial topology and algebra: the Eilenberg–Zilber algorithm
(Oxford Academic, 2013)The Eilenberg–Zilber algorithm is one of the central components of the computer algebra system called Kenzo, devoted ...