1300 search results - page 67 / 260 » Constraint satisfaction problems and global cardinality cons... |
140
click to vote
CP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Constraint satisfaction problems provide strong formalism for modeling variety of real life problems. This paper presents a work currently in progress of which the goal i...
140
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Constraint Satisfaction Problems and Propositional Satisfiability, are frameworks widely used to represent and solve combinatorial problems. A concept of primary importan...
165
click to vote
IFIP
2004
Springer
15 years 11 months ago
2004
Springer
Abstract The security of a network configuration is based not just on the security of its individual components and their direct interconnections, but also on the potential for sy...
137
click to vote
JUCS
2006
15 years 6 months ago
2006
This paper presents a parameterized schema for interval constraint branching that (with suitable instantiations of the parameters) can solve interval constraint satisfaction probl...
158
click to vote
CP
2000
Springer
15 years 10 months ago
2000
Springer
Constraint programming offers a variety of modeling objects such as logical and global constraints, that lead to concise and clear models for expressing combinatorial optimization...