2109 search results - page 42 / 422 » Solving Necklace Constraint Problems |
107
Voted
CP
2005
Springer
15 years 10 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 ...
140
click to vote
AICCSA
2006
IEEE
15 years 10 months ago
2006
IEEE
: The past decade witnessed rapid development of constraint satisfaction technologies, where algorithms are now able to cope with larger and harder problems. However, owing to the ...
136
click to vote
AAAI
1997
15 years 5 months ago
1997
Cooperative distributed problem solving (CDPS) loosely-coupledagentscan be effectively modeledas a distributed constraint satisfaction problem(DCSP) whereeach agent has multiple l...
136
click to vote
CP
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Thanks to its extended expressiveness, the quantified constraint satisfaction problem (QCSP) can be used to model problems that are difficult to express in the standard C...
116
click to vote
SAC
2009
ACM
15 years 11 months ago
2009
ACM
The combinatorial problem of decomposing an integer matrix into a small positive linear combination of binary matrices that have the consecutive-ones property arises in cancer rad...