Listar Ciencias de la Computación e Inteligencia Artificial por título 

Listar Ciencias de la Computación e Inteligencia Artificial por título

Mostrando ítems 851-870 de 880

    • Ponencia
      Icon

      Uniform Solution to QSAT Using Polarizationless Active Membranes 

      Alhazov, Artiom; Pérez Jiménez, Mario de Jesús (Fénix Editora, 2006)
      It is known that the satisfiability problem (SAT) can be solved a semi- uniform family of deterministic polarizationless ...
    • Artículo
      Icon

      Uniform solutions to SAT and Subset Sum by spiking neural P systems 

      Leporati, Alberto; Mauri, Giancarlo; Zandron, Claudio; Paun, Gheorghe; Pérez Jiménez, Mario de Jesús (Springer, 2009)
      We continue the investigations concerning the possibility of using spiking neural P systems as a framework for solving ...
    • Ponencia
      Icon

      Universal P Systems: One Catalyst Can Be Suficient 

      Freund, Rudolf; Paun, Gheorghe (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
      Icon

      Unveiling the underlying molecular basis of astaxanthin accumulation in Haematococcus through integrative metabolomic-transcriptomic analysis 

      Hoys Hernández, Cristina; Romero Losada, Ana Belén; Río, Esperanza del; Guerrero, Miguel G.; Romero Campero, Francisco José; García González, Mercedes (Elsevier, 2021)
      Astaxanthin is a valuable and highly demanded ketocarotenoid pigment, for which the chlorophycean microalga Haematococcus ...
    • Ponencia
      Icon

      Uranium- decay chain 

      Arazo, María; Barroso Mancha, Marc; Torre, Óscar de la; Moreno Valero, Laura; Ribes Metidieri, Ariadna; Ribes Metidieri, Patricia; Ventura, Ana; Orellana Martín, David (Fénix, 2016)
      The main objective of this article is to modelize the process of decay of Uranium within the framework of Membrane ...
    • Ponencia
      Icon

      Urban Knowledge Extraction, Representation and Reasoning as a Bridge from Data City towards Smart City 

      Miguel Rodríguez, Jaime de; Galán Páez, Juan; Aranda Corral, Gonzalo A.; Borrego Díaz, Joaquín (IEEE Computer Society, 2016)
      Urban Data management represents a major challenge in the field of Smart Cities. Its understanding is essential for the ...
    • Ponencia
      Icon

      Using A Kernel P System to Solve The 3-Col Problem 

      Ipate, Florentin; Dragomir, Ciprian; Lefticaru, Raluca; Mierla, Laurentiu; Pérez Jiménez, Mario de Jesús (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
      Icon

      Using Abstract Stobjs in ACL2 to Compute Matrix Normal Forms 

      Lambán Pardo, Laureano; Martín Mateos, Francisco Jesús; Rubio, Julio; Ruiz Reina, José Luis (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
      Icon

      Using Automated Reasoning Systems on Molecular Computing 

      Graciani Díaz, Carmen; Pérez Jiménez, Mario de Jesús (Springer, 2005)
      This paper is focused on the interplay between automated reasoning systems (as theoretical and formal devices to study ...
    • Capítulo de Libro
      Icon

      Using Cognitive Entropy to Manage Uncertain Concepts in Formal Ontologies 

      Borrego Díaz, Joaquín; Chávez González, Antonia María (Springer, 2008)
      A logical formalism to support the insertion of uncertain concepts in formal ontologies is presented. It is based on the ...
    • Ponencia
      Icon

      Using Maude 

      Clavel, Manuel; Durán, Francisco; Eker, Steven; Lincoln, Patrick; Martí Oliet, Narciso; Meseguer, José; Quesada Moreno, José Francisco (Springer, 2000)
    • Ponencia
      Icon

      Using Metaheuristic Algorithms Remotely via ROS 

      García Nieto, José Manuel; Alba, Enrique; Chicano, Francisco (ACM Digital Library, 2007)
    • Tesis Doctoral
      Icon

      Verificación de programas en modelos de computación no convencionales 

      Sancho Caparrini, Fernando (2002)
      El objetivo fundamental de esta memoria consiste en desarrollar una primer aproximación a la verificación formal de ...
    • Tesis Doctoral
      Icon

      Verificación formal en ACL2 del Algoritmo de Buchberger 

      Medina Bulo, Inmaculada (2003-12-18)
      En este trabajo se han desarrollado los elementos necesarios para especificar, implementar y verificar la correción del ...
    • Ponencia
      Icon

      Verification in ACL2 of a Generic Framework to Synthesize SAT–Provers 

      Martín Mateos, Francisco Jesús; Alonso Jiménez, José Antonio; Hidalgo Doblado, María José; Ruiz Reina, José Luis (Springer, 2002)
      We present in this paper an application of the ACL2 system to reason about propositional satisfiability provers. For that ...
    • Artículo
      Icon

      Verification of the Formal Concept Analysis 

      Alonso Jiménez, José Antonio; Borrego Díaz, Joaquín; Hidalgo Doblado, María José; Martín Mateos, Francisco Jesús; Ruiz Reina, José Luis (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
      Icon

      Verified Computer Algebra in ACL2 (Gröbner Bases Computation) 

      Medina Bulo, Inmaculada; Palomo Lozano, Francisco; Alonso Jiménez, José Antonio; Ruiz Reina, José Luis (Springer, 2004)
      In this paper, we present the formal verification of a Common Lisp implementation of Buchberger’s algorithm for ...
    • Artículo
      Icon

      Verifying a P system generating squares 

      Pérez Jiménez, Mario de Jesús; Sancho Caparrini, Fernando (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
      Icon

      Verifying an Applicative ATP Using Multiset Relations 

      Martín Mateos, Francisco Jesús; Alonso Jiménez, José Antonio; Hidalgo Doblado, María José; Ruiz Reina, José Luis (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
      Icon

      Verifying the bridge between simplicial topology and algebra: the Eilenberg–Zilber algorithm 

      Lambán Pardo, Laureano; Rubio, Julio; Martín Mateos, Francisco Jesús; Ruiz Reina, José Luis (Oxford Academic, 2013)
      The Eilenberg–Zilber algorithm is one of the central components of the computer algebra system called Kenzo, devoted ...