592 search results - page 44 / 119 » Using Constraint Programming to Solve the Maximum Clique Pro... |
138
click to vote
HEURISTICS
2008
15 years 1 months ago
2008
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
221
click to vote
CP
2009
Springer
16 years 3 months ago
2009
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
171
click to vote
RSP
1998
IEEE
15 years 7 months ago
1998
IEEE
One of the major differences in partitioning for codesign is in the way the communication cost is evaluated. Generally the size of the edge cut-set is used. When communication bet...
123
click to vote
CP
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. While the efficiency and scalability of modern SAT technology offers an intriguing alternative approach to constraint solving via translation to SAT, previous work has mo...
145
click to vote
MOZ
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Although Constraint Programming (CP) is considered a useful tool for tackling combinatorial problems, its lack of flexibility when dealing with uncertainties and prefere...