209 search results - page 2 / 42 » Decomposable Constraints |
MATES
2009
Springer
14 years 9 days ago
2009
Springer
In constraint satisfaction, decomposition is a common technique to split a problem in a number of parts in such a way that the global solution can be efficiently assembled from th...
ATAL
2011
Springer
12 years 5 months ago
2011
Springer
Distributed systems can often be modeled as a collection of distributed (system) variables whose values are constrained by a set of constraints. In distributed multi-agent systems...
CP
2007
Springer
13 years 12 months ago
2007
Springer
PARA
1995
Springer
13 years 9 months ago
1995
Springer
Coarse grain parallelism inherent in the solution of Linear Programming (LP) problems with block angular constraint matrices has been exploited in recent research works. However, t...
ACSC
2007
IEEE
14 years 3 days ago
2007
IEEE
A common approach in designing relational databases is to start with a universal relation schema, which is then decomposed into multiple subschemas. A good choice of subschemas ca...