activity
20132022
most citedNothing makes sense in deep learning, except in the light of evolution

2 citations · 8 across the 7 of their papers we have counts for

collaborators
Showing 2019Show all

2 papers · 1 filter

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…

cs.DS2019

Representing fitness landscapes by valued constraints to understand the complexity of local search

Artem Kaznatcheev, David A. Cohen, Peter G. Jeavons

Local search is widely used to solve combinatorial optimisation problems and to model biological evolution, but the performance of local search algorithms on different kinds of fit…