51 citations · 203 across the 13 of their papers we have counts for
3 papers · 1 filter
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…
Algorithms for the workflow satisfiability problem engineered for counting constraints
D. Cohen, J. Crampton, A. Gagarin +2
The workflow satisfiability problem (WSP) asks whether there exists an assignment of authorized users to the steps in a workflow specification that satisfies the constraints in the…
Iterative Plan Construction for the Workflow Satisfiability Problem
David Cohen, Jason Crampton, Andrei Gagarin +2
The \emph{Workflow Satisfiability Problem (WSP)} is a problem of practical interest that arises whenever tasks need to be performed by authorized users, subject to constraints defi…