116 search results - page 19 / 24 » On the solution-space geometry of random constraint satisfac... |
141
click to vote
AAAI
2006
15 years 7 months ago
2006
Model counting is the classical problem of computing the number of solutions of a given propositional formula. It vastly generalizes the NP-complete problem of propositional satis...
156
click to vote
AI
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. The general timetabling problem is an assignment of activities to xed time intervals, adhering to a prede ned set of resource availabilities. Timetabling problems are di ...
185
click to vote
CP
2007
Springer
16 years 2 days ago
2007
Springer
Abstract. Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that a technique called randomi...
142
click to vote
CSCLP
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. In [8], Freuder defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently [2], we extended the definition of interchangeability to Soft ...
152
click to vote
CPAIOR
2009
Springer
16 years 14 days ago
2009
Springer
In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP [1], and a library PKML for modelling packing problems. Unlike other modell...