Buscar
Mostrando ítems 1-10 de 19
Normality in non-integer bases and polynomial time randomness
(Academic Press Inc Elsevier Science, 2015-04)
It is known that if x ∈ [0, 1] is polynomial time random (i.e. no polynomial time computable martingale succeeds on the binary fractional expansion of x) then x is normal in any integer base greater than one. We show that ...
Water cycle algorithm: implementation and analysis of solutions to the bi-bjective travelling salesman problem
(International Journal of Artificial Intelligence, 2019)
This research is an implementation of the Water Cycle Algorithm (WCA) to solve the biobjective
Travelling Salesman Problem, based on the kroAB100 problem in the TSPLIB
library, and compare its performance to an alternative ...
ERNEAD: Training of Artificial Neural Networks Based on a Genetic Algorithm and Finite Automata Theory
(Editorial Board, 2018)
This paper presents a variation in the algorithm EMODS (Evolutionary Metaheuristic of Deterministic Swapping), at the level of its mutation stage in order to train algorithms for
each problem. It should be noted that the ...
Una herramienta didáctica interactiva para la enseñanza-aprendizaje de los autómatas finitos deterministas
(Universidad Inca Garcilaso de la Vega, 2013-10)
La asignatura, teoría de la Computación se cataloga como una de las que presentan mayor dificultad para los estudiantes universitarios y se ha observado que el dominio del tema de los autómatas finitos es fundamental para ...
Un modelo para la extracción de conocimiento en base de datos, mediante cómputo evolutivo, automátas finitos deterministas y reglas difusas
(Ediciones Universidad Simón BolívarFacultad de Ingenierías, 2019)
El objetivo de esta tesis es el desarrollo de un método para la extracción de conocimiento en grandes bases de datos. Hoy en día se genera a través de la tecnología grandes cantidades de datos, tanto en volumen como en la ...
Polynomial-Time Reformulations of LTL Temporally Extended Goals into Final-State Goals
(2015)
Linear temporal logic (LTL) is an expressive language that allows specifying temporally extended goals and preferences. A general approach to dealing with general LTL properties in planning is by "compiling them away"; ...
Fixing monotone Boolean networks asynchronously
(Elsevier, 2020)
The asynchronous automaton associated with a Boolean network f : {0, 1}(n) -> {0, 1}(n) is considered in many applications. It is the finite deterministic automaton with set of states {0,1}(n), alphabet {1, ..., n}, where ...
Autómata Finito Determinista
(2011-07)
The following document talks about the use of deterministic finite automaton (which are part of regular languages) which are abstractions of machines, without taking into account either the shape of machinery, not its size ...
Efficient logspace classes for enumeration, counting and uniform generation
(2019)
In this work, we study two simple yet general complexity classes, based on logspace Turing machines, which provide a unifying framework for efficient query evaluation in areas like information extraction and graph databases, ...
#NFA Admits an FPRAS: Efficient Enumeration, Counting, and Uniform Generation for Logspace Classes
(ASSOC COMPUTING MACHINERY, 2021)
In this work, we study two simple yet general complexity classes, based on logspace Turing machines, that provide a unifying framework for efficient query evaluation in areas such as information extraction and graph ...