ListarLCC - Contribuciones a congresos científicos por tema "Algoritmos genéticos"
Mostrando ítems 1-12 de 12
-
A Genetic Algorithm for solving the Discrete Ordered Median Problem with Induced Order
(2017-07-18)The Discrete Ordered Median Problem with Induced Ordered (DOMP+IO) is a multi-facility version of the classical discrete ordered median problem (DOMP), which has been widely studied. Several exact methods have been ... -
An improved multi-objective genetic algorithm for the neural architecture search problem.
(2023)In recent years, there is a great interest in automating the process of searching for neural network topology. This problem is called Neural Architecture Search (NAS), which can be seen as a 3-gear mechanism: the search ... -
Comparing metaheuristic algorithms for error detection in Java programs
(2015-09-07)Model checking is a fully automatic technique for checking concurrent software properties in which the states of a concurrent system are explored in an explicit or implicit way. The main drawback of this technique is the ... -
Evolutionary algorithm for prioritized pairwise test data generation
(2014-10-07)Combinatorial Interaction Testing (CIT) is a technique used to discover faults caused by parameter interactions in highly configurable systems. These systems tend to be large and exhaustive testing is generally impractical. ... -
Evolutionary Interactive Bot for the FPS Unreal Tournament 2004
(2015-06-18)This paper presents an interactive genetic algorithm for generating a human-like autonomous player (bot) for the game Unreal Tournament 2004. It is based on a bot modelled from the knowledge of an expert human player. ... -
Exact computation of the expectation curves for uniform crossover
(2014-10-07)Uniform crossover is a popular operator used in genetic algorithms to combine two tentative solutions of a problem represented as binary strings. We use the Walsh decomposition of pseudo-Boolean functions and properties ... -
Exact computation of the expectation curves of the bit-flip mutation using landscapes theory
(2015-09-07)Bit-flip mutation is a common operation when a genetic algorithm is applied to solve a problem with binary representation. We use in this paper some results of landscapes theory and Krawtchouk polynomials to exactly compute ... -
Generación de secuencias de pruebas funcionales con algoritmos bio-inspirados
(2015-02-10)La generación de secuencias de pruebas dinámicas desde una especificación formal complementa los métodos tradicionales de pruebas para encontrar errores en el código fuente. En este artículo extendemos un enfoque combinatorio ... -
Math Oracles: A New Way of Designing Efficient Self-Adaptive Algorithms
(ACM Press, 2013)In this paper we present a new general methodology to develop self-adaptive methods at a low computational cost. Instead of going purely ad-hoc we de ne several simple steps to include theoretical models as additional ... -
Migrants Selection and Replacement in Distributed Evolutionary Algorithms for Dynamic Optimization
(Springer, 2013)Many distributed systems (task scheduling, moving priorities, changing mobile environments, ...) can be linked as Dynamic Optimization Problems (DOPs), since they require to pursue an optimal value that changes over time. ... -
On the performance of some bioinspired genetic operators in complex structures evolution (long version)
(2017-01-10)Indirect encoding methods demand operators that minimize the disruption of conventional operators, widely studied in direct encoding approaches. While some efforts have already been done in this direction, the growing field ... -
Red Swarm: Smart Mobility in Cities with EAs
(ACM, 2013)This work presents an original approach to regulate traffic by using an on-line system controlled by an EA. Our proposal uses computational spots with WiFi connectivity located at traffic lights (the Red Swarm), which are ...