Listar por autor "Chicano-García, José-Francisco"
Mostrando ítems 21-40 de 84
-
Desarrollo de un sistema WEB para el proyecto LIMBO Space: Social Sound XP
(2022-09)LIMBO es un proyecto financiado por el Vicerrectorado de Smart Campus, cuyo objetivo es el de crear una estructura artística sonora y de forma circular ubicada en un espacio público del campus de la Universidad de Málaga ... -
Descomposición en landscapes elementales del problema de diseño de redes de radio con aplicaciones
Chicano-García, José-Francisco
; Arito, Franco; Alba-Torres, Enrique (2015-02-10)
En este trabajo se presenta la descomposición en landscapes elementales de un problema de optimización combinatoria: el problema de Diseño de Redes de Radio. La teoría de landscapes provee un marco formal en el cual un ... -
Dos estrategias de búsqueda anytime basadas en programación lineal entera para resolver el problema de selección de requisitos
Chicano-García, José-Francisco; Domínguez, Miguel A.; Del Águila, Isabel María; Del Sagrado, José; Alba-Torres, Enrique (2016-09-19)
El problema de selección de requisitos (o Next Release Problem, NRP) consiste en seleccionar el subconjunto de requisitos que se va a desarrollar en la siguiente versión de una aplicación software. Esta selección se debe ... -
Dynastic potential crossover operator
Chicano-García, José-Francisco (2019-10-28)
An optimal recombination operator provides an optimal solution fulfilling the gene transmission property: the value of any variable in the offspring must be inherited from one of the parents. In the case of binary variables, ... -
Dynastic Potential Crossover Operator
An optimal recombination operator for two parent solutions provides the best solution among those that take the value for each variable from one of the parents (gene transmission property). If the solutions are bit strings, ... -
EARMO: An Energy-Aware Refactoring Approach for Mobile Apps
Morales, Rodrigo; Saborido Infantes, Rubén; Khomh, Foutse; Chicano-García, José-Francisco; Antoniol, Giuliano (IEEE, 2018)
The energy consumption of mobile apps is a trending topic and researchers are actively investigating the role of coding practices on energy consumption. Recent studies suggest that design choices can conflict with energy ... -
Effective anytime algorithm for multiobjective combinatorial optimization problems
Domínguez-Ríos, Miguel Ángel; Alba-Torres, Enrique; Chicano-García, José-Francisco; Alba-Torres, Enrique (Elsevier, 2021-07)
In multiobjective optimization, the result of an optimization algorithm is a set of efficient solutions from which the decision maker selects one. It is common that not all the efficient solutions can be computed in a short ... -
Efficient anytime algorithms to solve the bi-objective Next Release Problem
Domínguez-Ríos, Miguel Ángel; Chicano-García, José-Francisco; Alba-Torres, Enrique; Del Águila, Isabel María; Del Sagrado, José (2019-06-27)
The Next Release Problem consists in selecting a subset of requirements to develop in the next release of a software product. The selection should be done in a way that maximizes the satisfaction of the stakeholders while ... -
Efficient Hill Climber for Constrained Pseudo-Boolean Optimization Problems
Chicano-García, José-Francisco; Whitley, L. Darrell; Tinós, Renato (2016-09-09)
Efficient hill climbers have been recently proposed for single- and multi-objective pseudo-Boolean optimization problems. For $k$-bounded pseudo-Boolean functions where each variable appears in at most a constant number ... -
Efficient Hill Climber for Multi-Objective Pseudo-Boolean Optimization
Chicano-García, José-Francisco; Whitley, L. Darrell; Tinós, Renato (2016-04-06)
Local search algorithms and iterated local search algorithms are a basic technique. Local search can be a stand-alone search method, but it can also be hybridized with evolutionary algorithms. Recently, it has been shown ... -
Efficient identification of improving moves in a ball for Pseudo-Boolean problems
Chicano-García, José-Francisco; Whitley, L. Darrell; Sutton, Andrew M. (2014-06-27)
Hill climbing algorithms are at the core of many approaches to solve optimization problems. Such algorithms usually require the complete enumeration of a neighborhood of the current solution. In the case of problems defined ... -
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 ... -
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 ... -
Elementary Landscape Decomposition of the Hamiltonian Path Optimization Problem
Whitley, L. Darrell; Chicano-García, José-Francisco (2014-04-04)
There exist local search landscapes where the evaluation function is an eigenfunction of the graph Laplacian that corresponds to the neighborhood structure of the search space. Problems that dis- play this structure are ... -
Elementary Landscape Decomposition of the Test Suite Minimization Problem
Landscape theory provides a formal framework in which combinatorial optimization problems can be theoretically characterized as a sum of a special kind of landscape called elementary landscape. The decomposition of the ... -
Enghancing communication: una herramienta para hacer frente a necesidades comunicativas complejas de personas con deficiencia intelectual severa
Resumen: Las habilidades de comunicación y el lenguaje son fundamentales para la participación humana en todos los aspectos de la vida diaria, la escuela y la comunidad (Light & McNaughton, 2012), puesto que permiten ... -
Enhancing partition crossover with articulation points analysis
Partition Crossover is a recombination operator for pseudo-Boolean optimization with the ability to explore an exponential number of solutions in linear or square time. It decomposes the objective function as a sum of ... -
Estimating Software Testing Complexity
Ferrer-Urbano, Francisco Javier; Chicano-García, José-Francisco; Alba-Torres, Enrique (Science Direct, 2013-07-29)
Context: Complexity measures provide us some information about software artifacts. A measure of the difficulty of testing a piece of code could be very useful to take control about the test phase. Objective: The aim in ... -
Evolutionary algorithm for prioritized pairwise test data generation
Ferrer-Urbano, Francisco Javier; Kruse, Peter M.; Chicano-García, José-Francisco; Alba-Torres, Enrique (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 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 ...