391 search results - page 44 / 79 » Locally Consistent Constraint Satisfaction Problems with Bin... |
117
click to vote
SCP
1998
15 years 1 months ago
1998
Consistency techniques are an e cient way of tackling constraint satisfaction problems (CSP). In particular, various arc-consistency algorithms have been designed such as the time...
127
click to vote
MP
2002
15 years 1 months ago
2002
The bounded multiple-class binary knapsack problem is a variant of the knapsack problem where the items are partitioned into classes and the item weights in each class are a multip...
102
click to vote
SETN
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. In order to obtain a solution to a constraint satisfaction problem, constructive methods iteratively extend a consistent partial assignment until all problem variables ar...
137
click to vote
PODS
2004
ACM
16 years 2 months ago
2004
ACM
Data exchange is the problem of taking data structured under a source schema and creating an instance of a target schema. Given a source instance, there may be many solutions ? ta...
111
click to vote
CP
1999
Springer
15 years 6 months ago
1999
Springer
The behaviour of many systems is naturally modelled by a set of ordinary differential equations (ODEs) which are parametric. Since decisions are often based on relations over these...