#### Filter Results:

- Full text PDF available (18)

#### Publication Year

1986

2013

- This year (0)
- Last 5 years (3)
- Last 10 years (10)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Ian P. Gent, Chris Jefferson, +4 authors Chris Unsworth
- 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â€¦ (More)

- David Manlove, Gregg O'Malley, Patrick Prosser, Chris Unsworth
- CPAIOR
- 2007

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â€¦ (More)

- Chris Unsworth, Patrick Prosser
- SARA
- 2005

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â€¦ (More)

- Mark Bartlett, Alan M. Frisch, Youssef Hamadi, Ian Miguel, Armagan Tarim, Chris Unsworth
- CPAIOR
- 2005

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â€¦ (More)

- Patrick Prosser, Chris Unsworth
- ACM Journal of Experimental Algorithmics
- 2011

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â€¦ (More)

- Myrto Arapinis, Muffy Calder, +9 authors Rehana Yasmin
- ECEASST
- 2009

Abstract: 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â€¦ (More)

- Muffy Calder, Philip D. Gray, Chris Unsworth
- ECEASST
- 2009

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â€¦ (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â€¦ (More)

Bigraphical reactive systems are a formalism for modelling mobile computation. A bigraph consists of a place graph and a link graph; reaction rules define how place and link graphs evolve. Bigraphsâ€¦ (More)

- Patrick Prosser, Chris Unsworth
- ECAI
- 2006

We present a specialised constraint for enforcing graph connectivity. It is assumed that we have a square symmetrical array A of 0/1 constrained integer variables representing potential undirectedâ€¦ (More)