1300 search results - page 53 / 260 » Constraint satisfaction problems and global cardinality cons... |
143
click to vote
CSCLP
2003
Springer
15 years 11 months ago
2003
Springer
Many real-life constraints describing relations between the problem variables have complex semantics and the constraint domain is defined using a table of compatible tuples rather ...
148
click to vote
CPAIOR
2005
Springer
15 years 11 months ago
2005
Springer
The Employee Timetabling Problem (ETP) is a general class of problems widely encountered in service organizations (such as call centers for instance). Given a set of activities, a ...
179
click to vote
AI
2005
Springer
15 years 6 months ago
2005
Springer
Constraint Satisfaction Problems (CSP) have been very successful in problem-solving tasks ranging from resource allocation and scheduling to configuration and design. Increasingly...
172
click to vote
CSE
2009
IEEE
16 years 27 days ago
2009
IEEE
—Constraint satisfaction has been a very successful paradigm for solving problems such as resource allocation and planning. Many of these problems pose themselves in a context in...
150
click to vote
APPROX
2004
Springer
15 years 11 months ago
2004
Springer
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, ....