Papers by J. Marcos Moreno Vega
Fuzzy Sets and Systems, 2004
Location problems concern a wide set of ÿelds where it is usually assumed that exact data are kno... more Location problems concern a wide set of ÿelds where it is usually assumed that exact data are known. However, in real applications, the location of the facility considered can be full of linguistic vagueness, that can be appropriately modelled using networks with fuzzy values. Thus fuzzy location problems on networks arise; this paper deals with their general formulation and the description of the ways to solve them. Namely, we show the variety of problems that can be considered in this context and, for some of them, we propose the most operative approaches for their solution.
2010 International Conference on Technologies and Applications of Artificial Intelligence, 2010
Recently, computer go has experienced great advance with the introduction of Monte-Carlo Tree Sea... more Recently, computer go has experienced great advance with the introduction of Monte-Carlo Tree Search (MCTS). Although MCTS programs are overall stronger than previous programs, their strength manifests mostly as the game advances. Strong human players applying established opening principles overtake current MCTS programs in the early moves of non-handicap 19×19 games. In this paper, the authors propose a method, M-eval, for implementing these opening principles in a program. M-eval is a multivariate evaluation function that provides a priori information for MCTS-based go programs. An initial vector made of k positive qualities both players wish to maximize is computed on a board position for each player. The initial vector is dimensionally reduced using non-negative matrix factorization to minimize informational loss. This reduction is done using the multivariate structure learned offline from a set of over 110,000 board positions from a database of master human games. The resulting R2 encoding is converted by regression to a real value used as a priori information in MCTS. Games were played using the MCTS GoKnot/QYZ framework with M-eval enabled against the same program without M-eval. Results show valuable improvement both in territorial gain and number of wins.
Lecture Notes in Computer Science, 2004
The ρhub median problem is an NP hard locationallocation problem, which consists of finding p p... more The ρhub median problem is an NP hard locationallocation problem, which consists of finding p points to establish facilities and the assignment of the users to these points. A new evolutionary approach that has been very effective for solving optimisation problems is ...
Lecture Notes in Computer Science, 2004
The feature selection problem in the field of classification consists of obtaining a subset of va... 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: the Forward Sequential Selection (FSS) and the Backward Sequential Selection (BSS). Promising results were obtained. We use the lazy learning strategy together with the nearest neighbour methodology (NN) also known as Instance-Based Learning Algorithm 1 (IB1).
A New Class of Algorithms, 2005
10 Parallel Scatter Search FELIX GARCIA LOPEZ, MIGUEL GARCIA TORRES, BELEN MELIAN BATISTA, JOSE A... more 10 Parallel Scatter Search FELIX GARCIA LOPEZ, MIGUEL GARCIA TORRES, BELEN MELIAN BATISTA, JOSE A. MORENO PEREZ, J. MARCOS ... The Scatter Search Template, proposed byGlover in 1998 [13], summarizes the general description of Scatter Search given in [12 ...
En los Métodos Multi-arranque se alternan una fase de generación de soluciones con otra de mejora... more En los Métodos Multi-arranque se alternan una fase de generación de soluciones con otra de mejora de las mismas. El proceso se repite hasta que se cumpla un criterio de parada. Este esquema sencillo suministra un procedimiento que combina adecuadamente el poder de exploración de los métodos de construcción con el poder de explotación de los métodos de mejora. En el presente trabajo se enumeran las principales aportaciones yéxitos de los Métodos Multi-arranque, tanto para problemas combinatorios como para problemas de optimización global. Además, se describe un Método Multi-arranque para el problema del ancho de banda. * El primer autor ha sido subvencionado parcialmente por el Ministerio de Ciencia y Tecnología a través del proyecto TIC2000-1750-C06-01 ** El segundo autor ha sido subvencionado parcialmente por el Ministerio de Ciencia y Tecnología a través del proyecto TIC2002-04242-C03-01. El 70 % de la ayuda de dicho proyecto proviene del Fondo Europeo de Desarrollo Regional (FEDER).
Fuzzy Sets and Systems, 2004
Location problems concern a wide set of ÿelds where it is usually assumed that exact data are kno... more Location problems concern a wide set of ÿelds where it is usually assumed that exact data are known. However, in real applications, the location of the facility considered can be full of linguistic vagueness, that can be appropriately modelled using networks with fuzzy values. Thus fuzzy location problems on networks arise; this paper deals with their general formulation and the description of the ways to solve them. Namely, we show the variety of problems that can be considered in this context and, for some of them, we propose the most operative approaches for their solution.
Uploads
Papers by J. Marcos Moreno Vega