Peter Jeavons
|
Professor Peter Jeavons
Professor of Computer Science
Director of Teaching
Fellow,
St Anne's College
Peter.Jeavons@cs.ox.ac.uk
Wolfson Building, Parks Road, Oxford OX1 3QD |
Interests
I'm interested in algorithms and computational complexity. Most of my own research has focused on constraint satisfaction problems.
I'm also interested in computational biology, especially bioinformatics .
I was on the Advisory Board for a project based at Harvard University involving computerisation of medieval music manuscripts (The NEUMES Project) and I worked with Louis Barton and Professor John Caldwell to develop this further, with the help of a grant from the Eduserv Foundation.
Selected Publications
| An algebraic theory of complexity for valued constraints: Establishing a Galois connection David A. Cohen‚ Páidí Creed‚ Peter G. Jeavons and Stanislav Živný In Proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science (MFCS'11). Vol. 6907 of Lecture Notes in Computer Science. Pages 231–242. Springer. 2011. Details | BibTeX | Link (pdf) | DOI (10.1007/978-3-642-22993-0_23) |
| Tackling the Partner Units Configuration Problem Markus Aschinger‚ Conrad Drescher‚ Georg Gottlob‚ Peter Jeavons and Evgenij Thorstensen In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011). Barcelona‚ Spain. 2011. |
| Optimization Methods for the Partner Units Problem Markus Aschinger‚ Conrad Drescher‚ Gerhard Friedrich‚ Georg Gottlob‚ Peter Jeavons‚ Anna Ryabokon and Evgenij Thorstensen In Proceedings of the 8th International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2011). Berlin‚ Germany. 2011. |
Info
|
Themes |
|
|
Activities |
Bioinformatics group | Computational Biology group | Constraints Group |
|
Projects |
Constraint Satisfaction for Configuration: Logical Fundamentals, Algorithms, and Complexity |
|
Completed Projects |
Groebner Basis Techniques for Constraint Satisfaction Problems | Complexity of Valued Constraints | |
|
Students |
|