Ponencias (Ciencias de la Computación e Inteligencia Artificial): Envíos recientes
Mostrando ítems 101-120 de 442
-
Ponencia
Sobre ciertas expresiones de la función rango, independientes de la teoría de ordinales
(Universitat Autónoma de Barcelona, 1980)In the present work we obtain several representations of the rank func- tion associated to a well founded relation in terms ...
-
Ponencia
Simulation of Computing P Systems: A GPU Design for the Factorization Problem
(Friedrich-Schiller-Universität Jena, 2018) -
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 ...
-
Ponencia
Simulating Active Membrane Systems Using GPUs
(Universidad de Sevilla, Departamento de Ciencias de la Computación e Inteligencia Artificial, 2009)Software development for cellular computing is growing up yielding new applications. In this paper, we describe a simulator ...
-
Ponencia
A First Attempt to Model Notch Signalling by Means of P Systems
(Universidad de Sevilla, Departamento de Ciencias de la Computación e Inteligencia Artificial, 2009)During mammalian central nervous system development, an enormous variety of cell types are generated. This cell diversity ...
-
Ponencia
Towards a verifiable topology of data
(Universidad de La Rioja, Departamento de Matemáticas y Computación, 2016) -
Ponencia
Sensorización y control de un proceso de mecanizado utilizando un sistema experto basado en reglas
(Asociación Española de Dirección e Ingeniería de Proyectos (AEIPRO), 2010)Aunque el proceso de fabricación por arranque de viruta ha evolucionado mucho en los últimos años con la incorporación ...
-
Ponencia
Progress Report: Term Dags Using Stobjs
(University of Texas, 2002)We explore in this paper the use of efficient data structures to implement operations on first-order terms, that can be ...
-
Ponencia
A Theory About First-Order Terms in ACL2
(University of Texas, 2002)We describe the development in ACL2 of a library of results about first-order terms. In particular, we present the ...
-
Ponencia
A Generic Instantiation Tool and a Case Study: A Generic Multiset Theory.
(University of Texas, 2002)In some cases, when we develop a formal theory in ACL2, it would be desirable that the definitions and theorems of the ...
-
Ponencia
New applications for an old tool
(Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla, 2019)First, the dependency graph technique, not so far from its current application, was developed trying to nd the shortest ...
-
Ponencia
A syntax for semantics in P-Lingua
(Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla, 2019)P-Lingua is a software framework for Membrane Computing, it includes a programming language, also called P-Lingua, for ...
-
Ponencia
An apparently innocent problem in Membrane Computing
(Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla, 2019)The search for effcient solutions of computationally hard problems by means of families of membrane systems has lead to ...
-
Ponencia
A new perspective on computational complexity theory in Membrane Computing
(Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla, 2019)A single Turing machine can solve decision problems with an in nite number of instances. On the other hand, in the framework ...
-
Ponencia
P Systems: from Anti-Matter to Anti-Rules
(Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla, 2019)The concept of a matter object being annihilated when meeting its corresponding anti-matter object is taken over for rule ...
-
Ponencia
Decision-Theoretic Planning with Person Trajectory Prediction for Social Navigation
(Springer, 2015)Robots navigating in a social way should reason about people intentions when acting. For instance, in applications like ...
-
Ponencia
Secure Communication of Local States in Interpreted Systems
(Springer, 2011)Given an interpreted system, we investigate ways for two agents to communicate secrets by public announcements. For card ...
-
Ponencia
Provably Total Primitive Recursive Functions: Theories with Induction
(Springer, 2004)A natural example of a function algebra is R (T), the class of provably total computable functions (p.t.c.f.) of a theory ...
-
Ponencia
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.
-
Ponencia
Local Induction and Provably Total Computable Functions: A Case Study
(Springer, 2012)Let IΠ−2 denote the fragment of Peano Arithmetic obtained by restricting the induction scheme to parameter free Π2 ...