Listar LCC - Artículos por fecha de publicación
Mostrando ítems 21-40 de 188
-
An evaluation of best compromise search in graphs
Machuca, Enrique; Mandow-Andaluz, Lorenzo
; Galand, Lucie (Springer, 2013-09)
This work evaluates two different approaches for multicriteria graph search problems using compromise preferences. This approach focuses search on a single solution that represents a balanced tradeoff between objectives, ... -
PQ-learning: aprendizaje por refuerzo multiobjetivo
En este artí culo describimos y analizamos PQ-learning, un algoritmo para problemas de aprendizaje por refuerzo multiobjetivo. El algoritmo es una extensi ón de Q-learning, un algoritmo para problemas de aprendizaje ... -
Multi-objective Reinforcement Learning
(2013-09-25)In this talk we present PQ-learning, a new Reinforcement Learning (RL) algorithm that determines the rational behaviours of an agent in multi-objective domains -
Melomics: A Case-Study of AI in Spain
Sánchez-Quintana, Carlos Alberto; Moreno-Arcas, Francisco; Albarracín Molina, David Daniel; Fernández-Rodríguez, Jose David; Vico-Vela, Francisco José (Association for the Advancement of Artificial Intelligence, 2013-10)
Traditionally focused on good old-fashioned AI and robotics, the Spanish AI community holds a vigorous computational intelligence substrate. Neuromorphic, evolutionary, or fuzzylike systems have been developed by ... -
Embryomorphic Engineering: Emergent innovation through evolutionary development
(2014-01-07)Embryomorphic Engineering, a particular instance of Morpho-genetic Engineering, takes its inspiration directly from biological development to create new hardware, software or network architectures by decentralized ... -
Randomness and control in design processes: an empirical study with architecture students.
Belmonte-Martínez, María Victoria; Millán-Valldeperas, Eva; Ruiz-Montiel, Manuela; Badillo, Reyes; Boned-Purkiss, Francisco Javier; Mandow-Andaluz, Lorenzo; Pérez-de-la-Cruz-Molina, José Luis[et al.] (2014-02-12)
The aim of this study is to explore designers' preferences between randomness and control in the generation of architectural forms. To this end, a generative computer tool was implemented that allows both random and ... -
Virtual player design using self-learning via competitive coevolutionary algorithms
Nogueira-Collazo, Mariela; Cotta-Porras, Carlos; Fernández-Leiva, Antonio José (Springer, 2014-06)
The Google Artificial Intelligence (AI) Challenge is an international contest the objective of which is to program the AI in a two-player real time strategy (RTS) game. This AI is an autonomous computer program that governs ... -
Vida artificial: en la encrucijada
(Universidad de Málaga, 2014-06-13)En las últimas décadas, la línea divisoria entre la Biología y las Ciencias de la Computación se ha ido difuminando paulatinamente. Por un lado, una gran cantidad de métodos computacionales (colectivamente conocidos como ... -
Exact computation of the expectation surfaces for uniform crossover along with bit-flip mutation
Uniform crossover and bit-flip mutation are two popular operators used in genetic algorithms to generate new solutions in an iteration of the algorithm when the solutions are represented by binary strings. We use the Walsh ... -
The component model for elementary landscapes and partial neighborhoods
Whitley, L. Darrell; Sutton, Andrew M.; Ochoa, Gabriela; Chicano-García, José-Francisco (2014-09-29)
Local search algorithms exploit moves on an adjacency graph of the search space. An “elementary landscape” exists if the objective function f is an eigenfunction of the Laplacian of the graph induced by the neighborhood ... -
Elementary landscape decomposition of the frequency assignment problem
Chicano-García, José-Francisco; Whitley, L. Darrell; Alba-Torres, Enrique; Luna, Francisco (2014-09-30)
The Frequency Assignment Problem (FAP) is an important problem that arises in the design of radio networks, when a channel has to be assigned to each transceiver of the network. This problem is a generalization of the graph ... -
Software project management with GAs
Alba-Torres, Enrique; Chicano-García, José-Francisco (2014-10-01)
A Project Scheduling Problem consists in deciding who does what during the software project lifetime. This is a capital issue in the practice of software engineering, since the total budget and human resources involved ... -
Observations in using parallel and sequential evolutionary algorithms for automatic software testing
Alba-Torres, Enrique; Chicano-García, José-Francisco (2014-10-01)
In this paper we analyze the application of parallel and sequential evolutionary algorithms (EAs) to the automatic test data generation problem. The problem consists of automatically creating a set of input data to test a ... -
Elementary landscape decomposition of the 0-1 unconstrained quadratic optimization
Chicano-García, José-Francisco; Alba-Torres, Enrique (2014-10-01)
Landscapes’ theory provides a formal framework in which combinatorial optimization problems can be theoretically characterized as a sum of an especial kind of landscape called elementary landscape. The elementary landscape ... -
The software project scheduling problem: A scalability analysis of multi-objective metaheuristics
Luna, Francisco; González-Álvarez, David L.; Chicano-García, José-Francisco; Vega-Rodríguez, Miguel A. (2014-10-02)
Computer aided techniques for scheduling software projects are a crucial step in the software development process within the highly competitive software industry. The Software Project Scheduling (SPS) problem relates to ... -
A methodology to find the elementary landscape decomposition of combinatorial optimization problems
A small number of combinatorial optimization problems have search spaces that correspond to elementary landscapes, where the objective function f is an eigenfunction of the Laplacian that describes the neighborhood structure ... -
Search based algorithms for test sequence generation in functional testing
Ferrer-Urbano, Francisco Javier; Kruse, Peter M.; Chicano-García, José-Francisco; Alba-Torres, Enrique (2014-10-03)
The generation of dynamic test sequences from a formal specification, complementing traditional testing methods in order to find errors in the source code. Objective In this paper we extend one specific combinatorial ... -
Fitness function distributions over generalized search neighborhoods in the q-ary hypercube
Sutton, Andrew M.; Chicano-García, José-Francisco; Whitley, L. Darrell (2014-10-03)
The frequency distribution of a fitness function over regions of its domain is an important quantity for understanding the behavior of algorithms that employ randomized sampling to search the function. In general, exactly ... -
Evolutionary algorithms for the multi-objective test data generation problem
Automatic test data generation is a very popular domain in the field of search-based software engineering. Traditionally, the main goal has been to maximize coverage. However, other objectives can be defined, such as the ... -
A GRASP-based memetic algorithm with path relinking for the far from most string problem.
Gallardo-Ruiz, José Enrique; Cotta-Porras, Carlos (Elsevier, 2015)
The FAR FROM MOST STRING PROBLEM (FFMSP) is a string selection problem. The objective is to find a string whose distance to other strings in a certain input set is above a given threshold for as many of those strings as ...