Félix C. García López

Learn More
The aim of this paper is to develop a hybrid metaheuristic based on Variable Neighbourhood Search and Tabu Search for solving the Feature Subset Selection Problem in classification. Given a set of instances characterized by several features, the classification problem consists of assigning a class to each instance. Feature Subset Selection Problem selects a(More)
The feature selection problem in the field of classification consists of obtaining a subset of variables to optimally realize the task without taking into account the remainder variables. This work presents how the search for this subset is performed using the Scatter Search metaheuristic and is compared with two traditional strategies in the literature:(More)
It is usually difficult for OpenMP programmers to use programming design techniques based on exhaustive search like backtracking, branch and bound, and dynamic programming. Thus, in order to solve this problem properly, this paper suggests an extension to the OpenMP model consisting of a new and efficient synchronization model (Monitor model). Also, a(More)
  • 1