1

Solving ga-hard problems with EMMRS and GPGPUs
Different techniques have been proposed to tackle GA-Hard problems. Some techniques work with different encodings and representations, …
Citar DOI
Solving resource-constraint project scheduling problems based on aco algorithms
Constraint Satisfaction Problems (CSP) belongs to this kind of traditional NPhard problems with a high impact in both, research and …
Citar
A new CSP graph-based representation for ant colony optimization
Constraint Satisfaction Problems (CSP) have been widely studied in several research areas like Artificial Intelligence or Operational …
Citar DOI
An evolutionary methodology for automatic design of finite state machines
We propose an evolutionary flow for finite state machine inference through the cooperation of grammatical evolution and a genetic …
Citar DOI
Búsqueda de Vecindad Variable secuencial y paralela: una aplicación al problema de la maximización del corte
En este trabajo se propone un análisis comparativo de la implementación paralela y secuencial de un algoritmo basado en el es-quema …
Citar
Cálculo de separadores de grafos utilizando búsqueda de vecindad variable reducida
Dado un grafo conexo y no dirigido G = (V, E) y un lími-te entero positivo b, el problema del Vertex Separator (VS) consiste en …
Citar
Computing graph separators with variable neighborhood search
Citar
Hiperheurística basada en minería de datos para la resolución de problemas de caja negra
El estudio y resoluci ́on de problemas complejos medianteel uso de metaheur ́ısticas es un tema muy extendido en el ́areade …
Citar
Urban traffic surveillance in smart cities using radar images
The Smart City concept arises from the need to provide more intelligent and optimized applications for the development of future urban …
Citar DOI
URJC&UNED at ImageCLEF 2013 Photo Annotation Task.
In this work we describe the URJC&UNED participation in the ImageCLEF 2013 Photo Annotation Task. We use visual information to find …
Citar