default search action
Barbara M. Smith
Person information
- affiliation: University College Cork, Ireland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
- [i2]Brahim Hnich, Barbara M. Smith, Toby Walsh:
Dual Modelling of Permutation and Injection Problems. CoRR abs/1107.0038 (2011) - 2010
- [j16]Barbara M. Smith, Jean-François Puget:
Constraint models for graceful graphs. Constraints An Int. J. 15(1): 64-92 (2010) - [i1]Tim Januschowski, Barbara M. Smith, Marc R. C. van Dongen:
Symmetry Breaking with Polynomial Delay. CoRR abs/1012.5585 (2010)
2000 – 2009
- 2009
- [j15]J. Christopher Beck, Barbara M. Smith:
Introduction to the special volume on constraint programming, artificial intelligence, and operations research. Ann. Oper. Res. 171(1): 1-2 (2009) - [j14]Hadrien Cambazard, Barry O'Sullivan
, Barbara M. Smith:
A constraint-based approach to Enigma 1225. Comput. Math. Appl. 58(8): 1487-1497 (2009) - [c35]Barbara M. Smith:
Observations on Symmetry Breaking. CP 2009: 5 - 2008
- [j13]Armagan Tarim
Constraint programming for computing non-stationary (R, S) inventory policies. Eur. J. Oper. Res. 189(3): 1004-1021 (2008) - 2007
- [j12]Ian P. Gent, Christopher Jefferson, Tom W. Kelsey, Inês Lynce, Ian Miguel, Peter Nightingale, Barbara M. Smith, Armagan Tarim:
Search in the patience game 'Black Hole'. AI Commun. 20(3): 211-226 (2007) - [j11]Yat Chiu Law, Jimmy Ho-Man Lee, Barbara M. Smith:
Automatic Generation of Redundant Models for Permutation Constraint Satisfaction Problems. Constraints An Int. J. 12(4): 469-505 (2007) - [c34]Barbara M. Smith, Stefano Bistarelli
Constraint Symmetry for the Soft CSP. CP 2007: 872-879 - 2006
- [j10]David A. Cohen, Peter Jeavons, Christopher Jefferson
Symmetry Definitions for Constraint Satisfaction Problems. Constraints An Int. J. 11(2-3): 115-137 (2006) - [j9]Brahim Hnich
Constraint Models for the Covering Test Problem. Constraints An Int. J. 11(2-3): 199-219 (2006) - [c33]David A. Cohen, Peter Jeavons, Christopher Jefferson, Karen E. Petrie, Barbara M. Smith:
Constraint Symmetry and Solution Symmetry. AAAI 2006: 1589-1592 - [c32]Barbara M. Smith:
Constraint Programming Models for Graceful Graphs. CP 2006: 545-559 - [e1]J. Christopher Beck, Barbara M. Smith:
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Third International Conference, CPAIOR 2006, Cork, Ireland, May 31 - June 2, 2006, Proceedings. Lecture Notes in Computer Science 3990, Springer 2006, ISBN 3-540-34306-7 [contents] - [r1]Barbara M. Smith:
Modelling. Handbook of Constraint Programming 2006: 377-406 - 2005
- [c31]David A. Cohen, Peter Jeavons, Christopher Jefferson, Karen E. Petrie, Barbara M. Smith:
Symmetry Definitions for Constraint Satisfaction Problems. CP 2005: 17-31 - [c30]Ian P. Gent
Conditional Symmetry Breaking. CP 2005: 256-270 - [c29]Barbara M. Smith:
Caching Search States in Permutation Problems. CP 2005: 637-651 - [c28]Barbara M. Smith:
Symmetry and Search in a Network Design Problem. CPAIOR 2005: 336-350 - [c27]Barbara M. Smith, Paula Sturdy:
Value Ordering for Finding All Solutions. IJCAI 2005: 311-316 - [c26]Alan M. Frisch
Transforming and Refining Abstract Constraint Specifications. SARA 2005: 76-91 - 2004
- [j8]Brahim Hnich
Dual Modelling of Permutation and Injection Problems. J. Artif. Intell. Res. 21: 357-391 (2004) - [c25]Barbara M. Smith, Karen E. Petrie, Ian P. Gent:
Models and Symmetry Breaking for 'Peaceable Armies of Queens'. CPAIOR 2004: 271-286 - 2003
- [c24]Ian P. Gent, Patrick Prosser, Barbara M. Smith, Wu Wei:
Supertree Construction with Constraint Programming. CP 2003: 837-841 - [c23]Karen E. Petrie, Barbara M. Smith:
Symmetry Breaking in Graceful Graphs. CP 2003: 930-934 - 2002
- [c22]Barbara M. Smith:
A Dual Graph Translation of a Problem in 'Life'. CP 2002: 402-414 - [c21]Iain McDonald, Barbara M. Smith:
Partial Symmetry Breaking. CP 2002: 431-445 - 2001
- [j7]Ian P. Gent
Random Constraint Satisfaction: Flaws and Structure. Constraints An Int. J. 6(4): 345-372 (2001) - [j6]Barbara M. Smith:
Constructing an asymptotic phase transition in random binary constraint satisfaction problems. Theor. Comput. Sci. 265(1-2): 265-283 (2001) - [c20]Ian P. Gent, Robert W. Irving, David F. Manlove, Patrick Prosser, Barbara M. Smith:
A Constraint Programming Approach to the Stable Marriage Problem. CP 2001: 225-239 - [c19]Barbara M. Smith:
Dual Models of Permutation Problems. CP 2001: 615-619 - [c18]Elias Oliveira, Barbara M. Smith:
A Combined Constraint-Based Search Method for Single-Track Railway Scheduling Problem. EPIA 2001: 371-378 - 2000
- [c17]Barbara M. Smith, Kostas Stergiou, Toby Walsh:
Using Auxiliary Variables and Implied Constraints to Model Non-Binary Problems. AAAI/IAAI 2000: 182-187 - [c16]Ian P. Gent, Barbara M. Smith:
Symmetry Breaking in Constraint Programming. ECAI 2000: 599-603 - [c15]Suniel D. Curtis, Barbara M. Smith, Anthony Wren:
Constructing Driver Schedules using Iterative Repair. PACPL 2000: 59-78
1990 – 1999
- 1999
- [j5]Sally C. Brailsford
Constraint satisfaction problems: Algorithms and applications. Eur. J. Oper. Res. 119(3): 557-581 (1999) - [c14]Barbara M. Smith:
The Brélaz Heuristic and Optimal Static Orderings. CP 1999: 405-418 - 1998
- [c13]Ewan MacIntyre, Patrick Prosser, Barbara M. Smith, Toby Walsh:
Random Constraint Satisfaction: Theory Meets Practice. CP 1998: 325-339 - [c12]Barbara M. Smith, Colin J. Layfield, Anthony Wren:
A constraint programming pre-processor for a bus driver scheduling system. Constraint Programming and Large Scale Discrete Optimization 1998: 131-148 - [c11]Barbara M. Smith, Stuart A. Grant:
Trying Harder to Fail First. ECAI 1998: 249-253 - 1997
- [c10]Barbara M. Smith, Stuart A. Grant:
Modelling Exceptionally Hard Constraint Satisfaction Problems. CP 1997: 182-195 - [c9]Barbara M. Smith:
Succeed-first or Fail-first: A Case Study in Variable and Value Ordering. PACT 1997: 321-330 - 1996
- [j4]Barbara M. Smith, Martin E. Dyer
Locating the Phase Transition in Binary Constraint Satisfaction Problems. Artif. Intell. 81(1-2): 155-181 (1996) - [j3]Barbara M. Smith, Sally C. Brailsford
The Progressive Party Problem: Integer Linear Programming and Constraint Programming Compared. Constraints An Int. J. 1(1/2): 119-138 (1996) - [j2]Sally C. Brailsford
Organizing a social event - A difficult problem of combinatorial optimization. Comput. Oper. Res. 23(9): 845-856 (1996) - [c8]Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Barbara M. Smith, Toby Walsh:
An Empirical Study of Dynamic Variable Ordering Heuristics for the Constraint Satisfaction Problem. CP 1996: 179-193 - [c7]Stuart A. Grant, Barbara M. Smith:
The Arc and Path Consistency Phase Transitions. CP 1996: 541-542 - [c6]Stuart A. Grant, Barbara M. Smith:
The Phase Transition Behaviour of Maintaining Arc Consistency. ECAI 1996: 175-179 - 1995
- [c5]Barbara M. Smith, Sally C. Brailsford
The Progressive Party Problem: Integer Linear Programming and Constraint Programming Compared. CP 1995: 36-52 - [c4]Barbara M. Smith:
In Search of Exceptionally Difficult Constraint Satisfaction Problems. Constraint Processing, Selected Papers 1995: 139-155 - [c3]Barbara M. Smith, Stuart A. Grant:
Sparse Constraint Graphs and Exceptionally Hard Problems. IJCAI (1) 1995: 646-654 - 1994
- [c2]Barbara M. Smith:
The Phase Transition and the Mushy Region in Constraint Satisfaction Problems. ECAI 1994: 100-104 - 1992
- [c1]Barbara M. Smith:
How to Solve the Zebra Problem, or Path Consistency the Easy Way. ECAI 1992: 36-37
1980 – 1989
- 1988
- [j1]Barbara M. Smith:
Impacs - A bus crew scheduling system using integer programming. Math. Program. 42(1-3): 181-187 (1988) - 1986
- [b1]Barbara M. Smith:
Bus crew scheduling using mathematical programming. University of Leeds, UK, 1986
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-15 20:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: