( en | de | ru )

 

Disambiguation of "Jeavons, Peter"

Author of the publication

copydeleteadd this publication to your clipboard
Decomposing Constraint Satisfaction Problems Using Database Techniques.

, , and . Artif. Intell., 66 (1): 57-89 (1994)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Tanja Elisabeth Peters

George Gershwins und Jerome Kerns Musicalsongs: ihre Ähnlichkeit, Wahrnehmung und musikalische Struktur. Uni Köln, (2008)

Andre Peters

Description and determination of soil hydraulic properties on the laboratory scale. TU Braunschweig, (2008)

Jillian Petersen

Diversity and ecology of chemosynthetic symbioses in deep-sea invertebrates. Uni Bremen, (2009)

Robert Martin Peterreins

Musikhörfähigkeit von Patienten mit elektroakustischer Stimulation: Testung anhand des Mu.S.I.C.-Tests. TU München, (2009)

Lars Ole Petersen

 

Other publications of authors with the same name

Decomposing Constraint Satisfaction Problems Using Database Techniques., , and . Artif. Intell., 66 (1): 57-89 (1994)Steering Evolution with Sequential Therapy to Prevent the Emergence of Bacterial Antibiotic Resistance, , , , , , , , and . PLoS Comput Biol, 11 (9): e1004493+ (Sep 11, 2015)Quantified Constraints: Algorithms and Complexity., , , and . CSL, volume 2803 of Lecture Notes in Computer Science, page 58-70. Springer, (2003)Classes of Submodular Constraints Expressible by Graph Cuts., and . CP, volume 5202 of Lecture Notes in Computer Science, page 112-127. Springer, (2008)A Maximal Tractable Class of Soft Constraints., , , and . IJCAI, page 209-214. Morgan Kaufmann, (2003)The Complexity of Constraints on Intervals and Lengths., , and . STACS, volume 2285 of Lecture Notes in Computer Science, page 443-454. Springer, (2002)Learnability of Quantified Formulas., and . EuroCOLT, volume 1572 of Lecture Notes in Computer Science, page 63-78. Springer, (1999)Finding Graph Decompositions via SAT., , , and . ICTAI, page 131-138. IEEE Computer Society, (2017)Enhancing the Prediction of Transcription Factor Binding Sites by Incorporating Structural Properties and Nucleotide Covariations., , and . J. Comput. Biol., 13 (4): 929-945 (2006)The complexity of maximal constraint languages., , and . STOC, page 667-674. ACM, (2001)