2861 search results - page 106 / 573 » Constraint Programming |
CP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The stable marriage problem (SM) and the Hospital / Residents problem (HR) are both stable matching problems. They consist of two sets of objects that need to be matched ...
SAS
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
JSW
2008
14 years 10 months ago
2008
Dynamic system reconfiguration techniques are presented that can enable the systematic evolution of software systems due to unanticipated changes in specification or requirements. ...
151
click to vote
POPL
2002
ACM
15 years 10 months ago
2002
ACM
We investigate the first-order theory of subtyping constraints. We show that the first-order theory of nonstructural subtyping is undecidable, and we show that in the case where a...
UM
2009
Springer
15 years 4 months ago
2009
Springer
Ideally designed software allow users to explore and pursue interleaving plans, making it challenging to automatically recognize user interactions. The recognition algorithms prese...