711 search results - page 84 / 143 » Amalgams of Constraint Satisfaction Problems |
231
Voted
CP
2009
Springer
16 years 5 months ago
2009
Springer
Abstract. In this paper, we show how model-checking can be generalized to temporal logic constraint solving, by considering temporal logic formulae with free variables over some do...
121
Voted
ASPDAC
1999
ACM
15 years 9 months ago
1999
ACM
We present an algorithm for solving a general min-cut, twoway partitioning problem subject to timing constraints. The problem is formulated as a constrained programming problem an...
139
Voted
CPAIOR
2007
Springer
15 years 10 months ago
2007
Springer
The Open-Shop Problem is a hard problem that can be solved using Constraint Programming or Operation Research methods. Existing techniques are efficient at reducing the search tree...
119
Voted
COR
2006
15 years 4 months ago
2006
Home health care, i.e. visiting and nursing patients in their homes, is a growing sector in the medical service business. From a staff rostering point of view, the problem is to f...
121
click to vote
CSCLP
2007
Springer
15 years 10 months ago
2007
Springer
Global constraints are used in constraint programming to help users specify patterns that occur frequently in the real world. In addition, global constraints facilitate the use of ...