Patrick Prosser (born 8 September 1952) is a computer scientist who spent the bulk of his career at the University of Glasgow. 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]

Patrick Prosser
Prosser in 2003
Born (1952-09-08) 8 September 1952 (age 72)
Glasgow, Scotland
NationalityScottish
Alma materStrathclyde University
Known forConflict-directed backjumping
Scientific career
FieldsConstraint programming
InstitutionsUniversity of Glasgow
Doctoral advisorIain Buchanan

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

edit
  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. ^ Prosser, Patrick (1993). "Hybrid Algorithms for the Constraint Satisfaction Problem". Computational Intelligence. 9 (3): 268–299. doi:10.1111/j.1467-8640.1993.tb00310.x.
  4. ^ Google Scholar search
  5. ^ Prosser, Patrick (1996). "An empirical study of phase transitions in binary constraint satisfaction problems". Artificial Intelligence. 81 (1–2): 81–109. doi:10.1016/0004-3702(95)00048-8.
  6. ^ Backer, Bruno De; Furnon, Vincent; Shaw, Paul; Kilby, Philip; Prosser, Patrick (2000). "Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics". Journal of Heuristics. 6 (4): 501–523. doi:10.1023/A:1009621410177. S2CID 15296616.
  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.
edit
pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy