Jump to content

Patrick Prosser

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by GreenC bot (talk | contribs) at 03:30, 13 February 2020 (Move 1 url. Wayback Medic 2.5). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Patrick Prosser
Born8 September 1952 (1952-09-08)
Glasgow
NationalityBritish
Alma materStrathclyde University
Known forConflict-directed backjumping
Scientific career
FieldsConstraint programming
InstitutionsGlasgow University
Doctoral advisorIain Buchanan

Patrick Prosser (born 8 September 1952) is a Computer Scientist at Glasgow University. His research has centred on Constraint programming, although it has extended into the application of those techniques into other areas. For his major contributions to the theory and practice of Constraint Programming, Patrick was awarded the Association for Constraint Programming's Research Excellence Award on 15 September 2011: he is only the sixth recipient of this award.[1] He gave a prerecorded acceptance speech, which is available on YouTube.[2]

His most notable contribution is his invention of Conflict-directed backjumping, an advanced technique for reducing search in constraint problems by avoiding unnecessary work on backtracking. His 1993 paper[3] describing this has been widely cited.[4]

Other areas of constraint programming he has researched include the identification of hard problems[5] and techniques for solving vehicle routing problems.[6] His interest in applications of constraint programming has included (for example) how it can be used in computing species trees.[7]

Amongst his recreations is kite flying as a founder of the Kite Club of Scotland. He has written about the Tetrahedral kite.[8]

References

  1. ^ Association for Constraint Programming's Research Excellence Award website. Archived 2 April 2012 at the Wayback Machine
  2. ^ Patrick Prosser's video acceptance speech playlist on Youtube.
  3. ^ HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM, Computational Intelligence, 1993, Vol 9, pages 268-299
  4. ^ Google Scholar search
  5. ^ An empirical study of phase transitions in binary constraint satisfaction problems, Artificial Intelligence, 1996, Vol 81, pages 81-109.
  6. ^ Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics, Journal of Heuristics, 1995, Vol 6, pages 501-523.
  7. ^ N. C. A. Moore and P. Prosser (2008) "The Ultrametric Constraint and its Application to Phylogenetics", JAIR, Volume 32, pages 901-938
  8. ^ The tetrahedral principle in kite design, revisited, Patrick Prosser, 1996.
Retrieved from "https://en.wikipedia.org/w/index.php?title=Patrick_Prosser&oldid=940538071"