19 citations · 46 across the 6 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2024★ 19 cited
A GRASP-based memetic algorithm with path relinking for the far from most string problem
José E. Gallardo, Carlos Cotta
The FAR FROM MOST STRING PROBLEM (FFMSP) is a string selection problem. The objective is to find a string whose distance to other strings in a certain input set is above a given th…
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…