470 search results - page 71 / 94 » Tabu Search for SAT |
96
Voted
IJCAI
2007
15 years 2 months ago
2007
Abstract. In this paper, nogood recording is investigated for CSP within the randomization and restart framework. Our goal is to avoid the same situations to occur from one run to ...
117
Voted
CP
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. The global cumulative constraint was proposed for modelling cumulative resources in scheduling problems for finite domain (FD) propagation. Since that time a great deal ...
87
Voted
GLVLSI
2005
IEEE
15 years 6 months ago
2005
IEEE
Boolean Satisfiability (SAT) solvers are popular engines used throughout the verification world. Bounded sequential problems such as bounded model checking and bounded sequentia...
149
click to vote
CPAIOR
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We propose a hybrid approach for solving the resource-constrained project scheduling problem which is an extremely hard to solve combinatorial optimization problem of pra...
120
Voted
ECAI
2004
Springer
15 years 4 months ago
2004
Springer
Quantified Constraint Satisfaction Problems (QCSPs) are CSPs in which some variables are universally quantified. For each possible value of such variables, we have to find ways to ...