Peter G. Jeavons
List of publications from the DBLP Bibliography Server - FAQ
2008 | ||
---|---|---|
62 | EE | Stanislav Zivný, Peter Jeavons: Classes of Submodular Constraints Expressible by Graph Cuts. CP 2008: 112-127 |
61 | EE | András Z. Salamon, Peter G. Jeavons: Perfect Constraints Are Tractable. CP 2008: 524-528 |
60 | EE | Martin C. Cooper, Peter G. Jeavons, András Z. Salamon: Hybrid tractable CSPs which generalize tree structure. ECAI 2008: 530-534 |
59 | EE | Stanislav Zivný, David A. Cohen, Peter G. Jeavons: The Expressive Power of Binary Submodular Functions CoRR abs/0811.1885: (2008) |
58 | EE | David A. Cohen, Peter Jeavons, Marc Gyssens: A unified theory of structural tractability for constraint satisfaction problems. J. Comput. Syst. Sci. 74(5): 721-743 (2008) |
57 | EE | David A. Cohen, Martin C. Cooper, Peter Jeavons: Generalising submodularity and horn clauses: Tractable optimization problems defined by tournament pair multimorphisms. Theor. Comput. Sci. 401(1-3): 36-51 (2008) |
56 | EE | David A. Cohen, Peter G. Jeavons, Stanislav Zivný: The expressive power of valued constraints: Hierarchies and collapses. Theor. Comput. Sci. 409(1): 137-153 (2008) |
2007 | ||
55 | EE | Gaofeng Huang, Peter Jeavons, Dominic Kwiatkowski: Exact and Heuristic Approaches for Identifying Disease-Associated SNP Motifs. APBC 2007: 175-184 |
54 | EE | Gaofeng Huang, Peter Jeavons: A Geometrical Model for the SNP Motif Identification Problem. BIBE 2007: 395-402 |
53 | EE | David A. Cohen, Peter Jeavons, Stanislav Zivný: The Expressive Power of Valued Constraints: Hierarchies and Collapses. CP 2007: 798-805 |
52 | EE | Louis W. G. Barton, Peter Jeavons, John A. Caldwell, Koon Shan Barry Ng: First class objects and indexes for chant manuscripts. JCDL 2007: 415-416 |
2006 | ||
51 | David A. Cohen, Peter Jeavons, Christopher Jefferson, Karen E. Petrie, Barbara M. Smith: Constraint Symmetry and Solution Symmetry. AAAI 2006 | |
50 | EE | David A. Cohen, Martin C. Cooper, Peter Jeavons: An Algebraic Characterisation of Complexity for Valued Constraint. CP 2006: 107-121 |
49 | EE | David A. Cohen, Marc Gyssens, Peter Jeavons: A Unifying Theory of Structural Decompostions for the Constraint Satisfaction Problems. Complexity of Constraints 2006 |
48 | EE | David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin: The complexity of soft constraint satisfaction. Artif. Intell. 170(11): 983-1016 (2006) |
47 | EE | David A. Cohen, Peter Jeavons, Christopher Jefferson, Karen E. Petrie, Barbara M. Smith: Symmetry Definitions for Constraint Satisfaction Problems. Constraints 11(2-3): 115-137 (2006) |
46 | EE | Sumedha Gunewardena, Peter Jeavons, Zhaolei Zhang: Enhancing the Prediction of Transcription Factor Binding Sites by Incorporating Structural Properties and Nucleotide Covariations. Journal of Computational Biology 13(4): 929-945 (2006) |
2005 | ||
45 | EE | David A. Cohen, Peter Jeavons, Christopher Jefferson, Karen E. Petrie, Barbara M. Smith: Symmetry Definitions for Constraint Satisfaction Problems. CP 2005: 17-31 |
44 | EE | David A. Cohen, Peter Jeavons, Marc Gyssens: A Unified Theory of Structural Tractability for Constraint Satisfaction and Spread Cut Decomposition. IJCAI 2005: 72-77 |
43 | EE | Louis W. G. Barton, John A. Caldwell, Peter Jeavons: E-library of medieval chant manuscript transcriptions. JCDL 2005: 320-329 |
42 | EE | David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin: Supermodular functions and the complexity of MAX CSP. Discrete Applied Mathematics 149(1-3): 53-72 (2005) |
41 | EE | Andrei A. Bulatov, Peter Jeavons, Andrei A. Krokhin: Classifying the Complexity of Constraints Using Finite Algebras. SIAM J. Comput. 34(3): 720-742 (2005) |
2004 | ||
40 | EE | David A. Cohen, Martin C. Cooper, Peter Jeavons: A Complete Characterization of Complexity for Boolean Constraint Optimization Problems. CP 2004: 212-226 |
39 | EE | David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin: Identifying Efficiently Solvable Cases of Max CSP. STACS 2004: 152-163 |
38 | EE | Richard Gault, Peter Jeavons: Implementing a Test for Tractability. Constraints 9(2): 139-160 (2004) |
37 | EE | David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin: A Maximal Tractable Class of Soft Constraints. J. Artif. Intell. Res. (JAIR) 22: 1-22 (2004) |
36 | EE | Andrei A. Krokhin, Peter Jeavons, Peter Jonsson: Constraint Satisfaction Problems on Intervals and Length. SIAM J. Discrete Math. 17(3): 453-477 (2004) |
2003 | ||
35 | EE | Andrei A. Bulatov, Peter Jeavons: An Algebraic Approach to Multi-sorted Constraints. CP 2003: 183-198 |
34 | EE | David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin: Soft Constraints: Complexity and Multimorphisms. CP 2003: 244-258 |
33 | EE | Ferdinand Börner, Andrei A. Bulatov, Peter Jeavons, Andrei A. Krokhin: Quantified Constraints: Algorithms and Complexity. CSL 2003: 58-70 |
32 | David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin: A Maximal Tractable Class of Soft Constraints. IJCAI 2003: 209-214 | |
31 | EE | Andrei A. Krokhin, Andrei A. Bulatov, Peter Jeavons: Functions of multiple-valued logic and the complexity of constraint satisfaction: A short survey. ISMVL 2003: 343- |
30 | EE | David A. Cohen, Peter Jeavons, Richard Gault: New Tractable Classes From Old. Constraints 8(3): 263-282 (2003) |
29 | EE | Andrei A. Krokhin, Peter Jeavons, Peter Jonsson: Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra. J. ACM 50(5): 591-640 (2003) |
28 | EE | Víctor Dalmau, Peter Jeavons: Learnability of quantified formulas. Theor. Comput. Sci. 306(1-3): 485-511 (2003) |
2002 | ||
27 | EE | Andrei A. Krokhin, Peter Jeavons, Peter Jonsson: The Complexity of Constraints on Intervals and Lengths. STACS 2002: 443-454 |
2001 | ||
26 | Andrei A. Krokhin, Peter Jeavons, Peter Jonsson: A Complete Classification of Complexity in Allens Algebra in the Presence of a Non-Trivial Basic Relation. IJCAI 2001: 83-88 | |
25 | EE | Andrei A. Bulatov, Andrei A. Krokhin, Peter Jeavons: The complexity of maximal constraint languages. STOC 2001: 667-674 |
24 | P. S. Umesh Adiga, A. Bhomra, M. G. Turri, A. Nicod, S. R. Datta, Peter Jeavons, Richard Mott, Jonathan Flint: Automatic analysis of agarose gel images. Bioinformatics 17(11): 1084-1089 (2001) | |
23 | EE | Andrei A. Krokhin, Peter Jeavons, Peter Jonsson: The complexity of constraints on intervals and lengths Electronic Colloquium on Computational Complexity (ECCC)(077): (2001) |
2000 | ||
22 | EE | David A. Cohen, Peter Jeavons, Richard Gault: New Tractable Classes from Old. CP 2000: 160-171 |
21 | EE | Andrei A. Bulatov, Andrei A. Krokhin, Peter Jeavons: Constraint Satisfaction Problems and Finite Algebras. ICALP 2000: 272-282 |
20 | EE | David A. Cohen, Peter Jeavons, Peter Jonsson, Manolis Koubarakis: Building tractable disjunctive constraints. J. ACM 47(5): 826-853 (2000) |
1999 | ||
19 | EE | Víctor Dalmau, Peter Jeavons: Learnability of Quantified Formulas. EuroCOLT 1999: 63-78 |
18 | Peter Jeavons, David A. Cohen, Marc Gyssens: How to Determine the Expressive Power of Constraints. Constraints 4(2): 113-131 (1999) | |
1998 | ||
17 | EE | Peter Jeavons: Constructing Constraints. CP 1998: 2-16 |
16 | Peter Jeavons, David A. Cohen, Justin Pearson: Constraints and Universal Algebra. Ann. Math. Artif. Intell. 24(1-4): 51-67 (1998) | |
15 | EE | Peter Jeavons, David A. Cohen, Martin C. Cooper: Constraints, Consistency and Closure. Artif. Intell. 101(1-2): 251-265 (1998) |
14 | EE | Peter Jeavons: On the Algebraic Structure of Combinatorial Problems. Theor. Comput. Sci. 200(1-2): 185-204 (1998) |
1997 | ||
13 | David A. Cohen, Peter Jeavons, Manolis Koubarakis: Tractable Disjunctive Constraints. CP 1997: 478-490 | |
12 | EE | Peter Jeavons, David A. Cohen, Marc Gyssens: Closure properties of constraints. J. ACM 44(4): 527-548 (1997) |
1996 | ||
11 | David A. Cohen, Marc Gyssens, Peter Jeavons: Derivation of Constraints and Database Relations. CP 1996: 134-148 | |
10 | Peter Jeavons, David A. Cohen, Marc Gyssens: A test for Tractability. CP 1996: 267-281 | |
1995 | ||
9 | Peter Jeavons, David A. Cohen: An Algebraic Characterization of Tractable Constraints. COCOON 1995: 633-642 | |
8 | Peter Jeavons, David A. Cohen, Marc Gyssens: A Unifying Framework for Tractable Constraints. CP 1995: 276-291 | |
7 | EE | Peter Jeavons, Martin C. Cooper: Tractable Constraints on Ordered Domains. Artif. Intell. 79(2): 327-339 (1995) |
1994 | ||
6 | Peter Jeavons, David A. Cohen, Martin C. Cooper: A Substitution Operation for Constraints. PPCP 1994: 1-9 | |
5 | Martin C. Cooper, David A. Cohen, Peter Jeavons: Characterising Tractable Constraints. Artif. Intell. 65(2): 347-361 (1994) | |
4 | Marc Gyssens, Peter Jeavons, David A. Cohen: Decomposing Constraint Satisfaction Problems Using Database Techniques. Artif. Intell. 66(1): 57-89 (1994) | |
3 | Peter Jeavons, David A. Cohen, John Shawe-Taylor: Generating binary sequences for stochastic computing. IEEE Transactions on Information Theory 40(3): 716-720 (1994) | |
2 | Peter Jeavons: Recovering a Relation from a Decomposition Using Constraint Satisfaction. Inf. Sci. 78(3-4): 229-256 (1994) | |
1993 | ||
1 | EE | Peter Jeavons: Counting Representable Sets on Simple Graphs. Discrete Applied Mathematics 47(1): 33-46 (1993) |