activity
20082024
most citedOptimizing Hearthstone Agents using an Evolutionary Algorithm

31 citations · 52 across the 6 of their papers we have counts for

collaborators

6 papers

cs.NE2024★ 1 cited

Epoch-based Application of Problem-Aware Operators in a Multiobjective Memetic Algorithm for Portfolio Optimization

Feijoo Colomine Durán, Carlos Cotta, Antonio J. Fernández-Leiva

We consider the issue of intensification/diversification balance in the context of a memetic algorithm for the multiobjective optimization of investment portfolios with cardinality…

cs.NE2024★ 2 cited

Memetic collaborative approaches for finding balanced incomplete block designs

David Rodríguez Rueda, Carlos Cotta, Antonio J. Fernández-Leiva

The balanced incomplete block design (BIBD) problem is a difficult combinatorial problem with a large number of symmetries, which add complexity to its resolution. In this paper, w…

cs.NE2024★ 31 cited

Optimizing Hearthstone Agents using an Evolutionary Algorithm

Pablo García-Sánchez, Alberto Tonda, Antonio J. Fernández-Leiva +1

Digital collectible card games are not only a growing part of the video game industry, but also an interesting research area for the field of computational intelligence. This game…

cs.AI2014★ 17 cited

Solving Weighted Constraint Satisfaction Problems with Memetic/Exact Hybrid Algorithms

José Enrique Gallardo, Carlos Cotta, Antonio José Fernández

A weighted constraint satisfaction problem (WCSP) is a constraint satisfaction problem in which preferences among solutions can be expressed. Bucket elimination is a complete techn…

cs.NE2012

Design of Emergent and Adaptive Virtual Players in a War RTS Game

José A. García Gutiérrez, Carlos Cotta, Antonio J. Fernández-Leiva

Basically, in (one-player) war Real Time Strategy (wRTS) games a human player controls, in real time, an army consisting of a number of soldiers and her aim is to destroy the oppon…

cs.NE2008★ 1 cited

Finding Still Lifes with Memetic/Exact Hybrid Algorithms

Jose E. Gallardo, Carlos Cotta, Antonio J. Fernandez

The maximum density still life problem (MDSLP) is a hard constraint optimization problem based on Conway's game of life. It is a prime example of weighted constrained optimization…