Antonio J. Fernández-leiva

Prof. Dr. Antonio J. Fernández-leiva

orcid

Research Focus & Metrics

Academic Career Length

29Years (1998-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
22 January 2007 in IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)
Verified
Journal Article
Closed access
JGJos E. Gallardo
Jos E. Gallardo
CCCarlos Cotta
Carlos Cotta
AFAntonio J. Fernández-leiva
Antonio J. Fernández-leiva
Branch-and-bound (BnB) and memetic algorithms represent two very different approaches for tackling combinatorial optimization problems. However, these approaches are compatible. In this correspondence, a hybrid model that combines these two techniques is considered. To be precise, it is based on the interleaved execution of both approaches. Since the requirements of time and memory in BnB techniques are generally conflicting, a truncated exact search, namely, beam search, has opted to be carried out. Therefore, the resulting hybrid algorithm has a heuristic nature. The multidimensional 0-1 knapsack problem and the shortest common supersequence problem have been chosen as benchmarks. As will be shown, the hybrid algorithm can produce better results in both problems at the same computational cost, especially for large problem instances

1 September 2009 in Applied Soft Computing
Verified
Journal Article
Closed access
JGJosé E. Gallardo
José E. Gallardo
CCCarlos Cotta
Carlos Cotta
AFAntonio J. Fernández-leiva
Antonio J. Fernández-leiva

1 January 2020 in Knowledge-Based Systems
Verified
Journal Article
Open access
PGPablo García-Sánchez
Pablo García-Sánchez
ATAlberto Tonda
Alberto Tonda
AFAntonio J. Fernández-leiva
Antonio J. Fernández-leiva
CCCarlos Cotta
Carlos Cotta

1 April 2013
Verified
Conference Paper
Closed access
RLRaul Lara-Cabrera
Raul Lara-Cabrera
CCCarlos Cotta
Carlos Cotta
AFAntonio J. Fernández-leiva
Antonio J. Fernández-leiva
Real-time strategy games offer a wide variety of fundamental AI research challenges. Most of these challenges have applications outside the game domain. This paper provides a review on computational intelligence in real-time strategy games (RTS). It starts with challenges in real-time strategy games, then it reviews different tasks to overcome this challenges. Later, it describes the techniques used to solve this challenges and it makes a relationship between techniques and tasks. Finally, it presents a set of different frameworks used as test-beds for the techniques employed. This paper is intended to be a starting point for future researchers on this topic.

1 July 2000 in Constraints
Verified
Journal Article
Closed access
PDF file
AFAntonio J. Fernández-leiva
Antonio J. Fernández-leiva
PHPatricia M. Hill
Patricia M. Hill

1 January 2008
Verified
Book Chapter
Closed access
PDF file
CBChristian Blum
Christian Blum
CCCarlos Cotta
Carlos Cotta
AFAntonio J. Fernández-leiva
Antonio J. Fernández-leiva
JGJosé E. Gallardo
José E. Gallardo
MMMonaldo Mastrolilli
Monaldo Mastrolilli