11 citations · 12 across the 8 of their papers we have counts for
Showing 2014 · cs.AIShow all
2 papers · 2 filters
cs.AI2014★ 11 cited
Simulating Non Stationary Operators in Search Algorithms
Adrien Goëffon, Frédéric Lardeux, Frédéric Saubion
In this paper, we propose a model for simulating search operators whose behaviour often changes continuously during the search. In these scenarios, the performance of the operators…
cs.AI2014
Set Constraint Model and Automated Encoding into SAT: Application to the Social Golfer Problem
Frédéric Lardeux, Eric Monfroy, Broderick Crawford +1
On the one hand, Constraint Satisfaction Problems allow one to declaratively model problems. On the other hand, propositional satisfiability problem (SAT) solvers can handle huge S…