111 citations · 240 across the 11 of their papers we have counts for
11 papers
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…
Deep Learning Classification of 3.5 GHz Band Spectrograms with Applications to Spectrum Sensing
W. Max Lees, Adam Wunderlich, Peter Jeavons +2
In the United States, the Federal Communications Commission has adopted rules permitting commercial wireless networks to share spectrum with federal incumbents in the 3.5~GHz Citiz…
Binary Constraint Satisfaction Problems Defined by Excluded Topological Minors
David A. Cohen, Martin C. Cooper, Peter G. Jeavons +1
The binary Constraint Satisfaction Problem (CSP) is to decide whether there exists an assignment to a set of variables which satisfies specified constraints between pairs of variab…
Binarisation for Valued Constraint Satisfaction Problems
David A. Cohen, Martin C. Cooper, Peter G. Jeavons +3
We study methods for transforming valued constraint satisfaction problems (VCSPs) to binary VCSPs. First, we show that the standard dual encoding preserves many aspects of the alge…
Feedback from Nature: Simple Randomised Distributed Algorithms for Maximal Independent Set Selection and Greedy Colouring
Peter Jeavons, Alex Scott, Lei Xu
We propose distributed algorithms for two well-established problems that operate efficiently under extremely harsh conditions. Our algorithms achieve state-of-the-art performance i…
Local Consistency and SAT-Solvers
Peter Jeavons, Justyna Petke
Local consistency techniques such as k-consistency are a key component of specialised solvers for constraint satisfaction problems. In this paper we show that the power of using k-…