#### Filter Results:

- Full text PDF available (61)

#### Publication Year

1986

2016

- This year (0)
- Last 5 years (4)
- Last 10 years (13)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Method

Learn More

- Barbara M. Smith, Martin E. Dyer
- Artif. Intell.
- 1996

The phase transition in binary constraint satisfaction problems, i.e. the transition from a region in which almost all problems have many solutions to a region in which almost all problems have noâ€¦ (More)

- Sally C. Brailsford, Chris N. Potts, Barbara M. Smith
- European Journal of Operational Research
- 1999

A constraint satisfaction problem (CSP) requires a value, selected from a given Â®nite domain, to be assigned to each variable in the problem, so that all constraints relating the variables areâ€¦ (More)

- Ian P. Gent, Barbara M. Smith
- ECAI
- 2000

We describea methodfor symmetrybreakingduring search(SBDS) in constraintprogramming.It hasthe greatadvantageof not interfering with heuristicchoices.It guaranteesto return a unique solution fromâ€¦ (More)

- David A. Cohen, Peter Jeavons, Christopher Jefferson, Karen E. Petrie, Barbara M. Smith
- Constraints
- 2005

We review the many different definitions of symmetry for constraint satisfaction problems (CSPs) that have appeared in the literature, and show that a symmetry can be defined in two fundamentallyâ€¦ (More)

- Barbara M. Smith, Sally C. Brailsford, Peter M. Hubbard, H. Paul Williams
- Constraints
- 1995

Many discrete optimization problems can be formulated as either integer linear programming problems or constraint satisfaction problems. Although ILP methods appear to be more powerful, sometimesâ€¦ (More)

The constraint satisfaction community has developed a number of heuristics for variable ordering during backtracking search. For example, in conjunction with algorithms which check forwards, theâ€¦ (More)

- Barbara M. Smith
- 2000

- Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Barbara M. Smith, Toby Walsh
- Constraints
- 2001

A recent theoretical result by Achlioptas et al. shows that many models of random binary constraint satisfaction problems become trivially insoluble as problem size increases. This insolubility isâ€¦ (More)

- Barbara M. Smith
- CPAIOR
- 2005

An optimization problem arising in the design of optical fibre networks is discussed. A network contains client nodes, each installed on one or more SONET rings. A constraint programming model of theâ€¦ (More)

- Barbara M. Smith
- CP
- 2002

Conwayâ€™s gameof Life providesinterestingproblemsin which modellingissuesin constraintprogrammingcanbeexplored. Theproblemof findingamaximumdensitystablepattern(â€˜still-lifeâ€™) is discussed. Aâ€¦ (More)