Dr Patrick Prosser

Patrick Prosser
  • Senior Lecturer (Computing Science)

telephone: 01413304934
email: Patrick.Prosser@glasgow.ac.uk


Personal site: http://www.dcs.gla.ac.uk/~pat/

Biography:
Patrick Prosser is a Senior Lecturer, and has degrees in Computer Science from Strathclyde University. Patrick has worked at the National Engineering Laboratory, Burroughs, Alcan Plate, and Britoil (formally BNOC). As an academic he has worked with BT, Alcan, YARD, ILOG, Pirelli, Tollpost Globe and SINTEF. Patrick is a member of the Formal Analysis, Theory and Algorithms research group and in 2011 received the ACP award for research excellence in constraint programming http://4c.ucc.ie/a4cp/

Research Interests:
- Constraint Programming
- Combinatorial Search
- Optimisation Problem
- Heuristics
- Algorithms and Complexity

Jump to: 2010 | 2008 | 2007 | 2006 | 2005 | 2004 | 2003 | 2002 | 2001
Number of items: 19.

2010

Prosser, P. (2010) Triangle packing with constraint programming. In: The 9th International Workshop on Constraint Modelling and Reformulation (ModRef 2010), 06 - 10 Sep 2010, St. Andrews. U.K.

2008

Cockshott, P., Koltes, A., O'Donnell, J. , Prosser, P. , and Vanderbauwhede, W. (2008) A hardware relaxation paradigm for solving NP-hard problems. In: Abramsky, S., Gelenbe, E. and Sassone, V. (eds.) Visions of Computer Science: BCS International Academic Conference, Imperial College, London, UK, 22-24 September 2008. BCS, Swindon, UK, pp. 75-86.

Moore, Neil C. A., and Prosser, Patrick (2008) The Ultrametric Constraint and its Application to Phylogenetics. Journal of Artificial Intelligence Research, 32 . pp. 901-938. ISSN 1076-9757 (doi:10.1613/jair.2580)

2007

Manlove, D.M., O'Malley, G. , Prosser, P. , and Unsworth, C. (2007) A constraint programming approach to the hospitals/residents problem. In: Proceedings of CP-AI-OR '07: the Fourth International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 23-26 May, 2007, Brussels, Belgium.

2006

Beck, JC, Prosser, P , and Selensky, E (2006) A case study of mutual routing-scheduling reformulation. Journal of Scheduling, 9 . pp. 469-491. (doi:10.1007/s10951-006-8596-4)

Prosser, P (2006) A case study of mutual scheduling-routing reformulation. Journal of Scheduling (volume 9) . pp. 469-491.

Prosser, P., and Unsworth, C. (2006) A connectivity constraint using bridges. In: Brewka, G. (ed.) ECAI 2006: 17th European Conference on Artificial Intelligence, August 29-September 1, 2006, Riva del Garda, Italy. Series: Frontiers in artificial intelligence and applications (141). IOS Press, Amsterdam, The Netherlands, pp. 707-708. ISBN 9781586036423

Prosser, P., and Unsworth, C. (2006) Rooted Tree and Spanning Tree Constraints. Other. Dept of Computing Science, University of Glasgow.

2005

Unsworth, C., and Prosser, P. (2005) A specialised binary constraint for the stable marriage problem. Lecture Notes in Computer Science, 3607 . pp. 218-233. ISSN 0302-9743 (doi:10.1007/11527862_16)

Beck, J.C., Prosser, P. , and Wallace, R.J. (2005) Trying again to fail-first. Lecture Notes in Computer Science, 3419 . pp. 41-55. ISSN 0302-9743 (doi:10.1007/11402763_4)

Unsworth, C., and Prosser, P. (2005) Specialised constraints for stable matching problems. Principles and Practice of Constraint Programming - Cp 2005, Proceedings, 3709 . p. 869.

2004

Beck, J.C., Prosser, P. , and Wallace, R.J. (2004) Failing first: an update. In: Lopez de Mantaras, R. and Saitta, L. (eds.) ECAI 2004: Proceedings of the 16th European Conference on Artificial Intelligence. Series: Frontiers in artificial intelligence and applications (110). IOS Press, Amsterdam, The Netherlands, pp. 959-960. ISBN 9781586034528

Beck, J.C., Prosser, P. , and Wallace, R.J. (2004) Trying again to fail-first. In: CSCLP 2004: Joint Annual Workshop of ERCIM/CoLogNet on Constraint Solving and Constraint Logic Programming, 23-25 June 2004, Lausanne, Switzerland.

Beck, JC, Prosser, P , and Wallace, RJ (2004) Variable ordering heuristics show promise. Principles and Practice of Constraint Programming - Cp 2004, Proceedings, 3258 . pp. 711-715.

2003

Prosser, P., and Selensky, E. (2003) A study of encodings of constraint satisfaction problems with 0/1 variables. Lecture Notes in Computer Science, 2627 . pp. 337-381. ISSN 0302-9743

Gent, IP, Prosser, P , Smith, BM, and Wei, W (2003) Supertree construction with constraint programming. Principles and Practice of Constraint Programming - Cp 2003, Proceedings, 2833 . pp. 837-841.

2002

Beck, J.C., Prosser, P. , and Selensky, E. (2002) Graph transformations for the vehicle routing and job shop scheduling problems. Lecture Notes in Computer Science, 2502 . pp. 60-74. ISSN 0302-9743

Beck, J.C., Prosser, P. , and Selensky, E. (2002) On the reformulation of vehicle routing problems and scheduling problems. Lecture Notes in Computer Science, 2371 . pp. 282-289. ISSN 0302-9743

2001

Prosser, P (2001) Random constraint satisfaction: flaws and structure. Constraints, 6 (4). pp. 345-372. (doi:10.1023/A:1011454308633)

This list was generated on Fri May 25 22:18:33 2012 BST.