#### Filter Results:

#### Publication Year

1992

2013

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Ian P. Gent, Chris Jefferson, Ian Miguel, Neil C.A. Moore, Peter Nightingale, Patrick Prosser +1 other
- 2011

With the ubiquity of multicore computing, and the likely expansion of it, it seems irresponsible for constraints researchers to ignore the implications of it. Therefore, the authors have recently begun investigating the literature in constraints on exploitation of parallel systems for constraint solving. We have been compiling an incomplete, biased, and… (More)

We present a specialised binary constraint for the stable marriage problem. This constraint acts between a pair of integer variables where the domains of those variables represent preferences. Our constraint enforces stability and disallows bigamy. For a stable marriage instance with n men and women we require n 2 of these constraints, and the complexity of… (More)

A constraint programming approach to the hospitals / residents problem. Abstract. An instance I of the Hospitals / Residents problem (HR) involves a set of residents (graduating medical students) and a set of hospitals, where each hospital has a given capacity. The residents have preferences for the hospitals, as do hospitals for residents. A solution of I… (More)

This paper introduces a problem called the temporal knapsack problem, presents several algorithms for solving it, and compares their performance. The temporal knapsack problem is a generalisation of the knapsack problem and specialisation of the multidimensional (or multiconstraint) knapsack problem. It arises naturally in applications such as allocating… (More)

Harvey and Ginsberg's limited discrepancy search (LDS) is based on the assumption that costly heuristic mistakes are made early in the search process. Consequently, LDS repeatedly probes the state space, going against the heuristic (i.e., taking discrepancies) a specified number of times in all possible ways and attempts to take those discrepancies as early… (More)

We present two specialised constraints for modelling trees. The first constrains a set of variables, such that each variable takes as a value the index of its parent variable, with the exception of one variable that takes as a value its own index and becomes the root, and this results in a rooted tree. The second constraint assumes that constrained… (More)

- Chris Unsworth
- 2008

We consider the problem of verifying context-aware, pervasive, interactive systems when the interaction involves both system configuration and system use. Verification of configurable systems is more tightly coupled to design when the verification process involves reasoning about configurable formal models. The approach is illustrated with a case study:… (More)

- Myrto Arapinis, Muffy Calder, Louise A. Dennis, Michael Fisher, Philip D. Gray, Savas Konur +6 others
- ECEASST
- 2009

Pervasive systems, that is roughly speaking systems that can interact with their environment, are increasingly common. In such systems, there are many dimensions to assess: security and reliability, safety and liveness, real-time response, etc. So far modelling and formalizing attempts have been very piecemeal approaches. This paper describes our analysis… (More)