9 citations · 11 across the 6 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.NE2019
Is perturbation an effective restart strategy?
Aldeida Aleti, Mark Wallace, Markus Wagner
Premature convergence can be detrimental to the performance of search methods, which is why many search algorithms include restart strategies to deal with it. While it is common to…
cs.DM2019★ 2 cited
Steepest ascent can be exponential in bounded treewidth problems
David A. Cohen, Martin C. Cooper, Artem Kaznatcheev +1
We investigate the complexity of local search based on steepest ascent. We show that even when all variables have domains of size two and the underlying constraint graph of variabl…