79 citations · 114 across the 23 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.AI2011★ 1 cited
Modelling Constraint Solver Architecture Design as a Constraint Problem
Ian P. Gent, Chris Jefferson, Lars Kotthoff +1
Designing component-based constraint solvers is a complex problem. Some components are required, some are optional and there are interdependencies between the components. Because o…
cs.AI2011★ 79 cited
Backbone Fragility and the Local Search Cost Peak
I. P. Gent, J. Singer, A. Smaill
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instance…