882 search results - page 2 / 177 » Local Search for Very Large SAT Problems |
AE
2007
Springer
13 years 11 months ago
2007
Springer
We present GP-HH, a framework for evolving local-search 3-SAT heuristics based on GP. The aim is to obtain “disposable” heuristics which are evolved and used for a specific su...
JAIR
2000
13 years 4 months ago
2000
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...
COR
2010
13 years 5 months ago
2010
Companies in the concrete industry are facing the following scheduling problem on a daily basis: concrete produced at several plants has to be delivered at customers' constru...
ECAI
2008
Springer
13 years 6 months ago
2008
Springer
While stochastic local search (SLS) techniques are very efficient in solving hard randomly generated propositional satisfiability (SAT) problem instances, a major challenge is to i...
GECCO
2004
Springer
13 years 10 months ago
2004
Springer
Satisfiability testing (SAT) is a very active area of research today, with numerous real-world applications. We describe CLASS2.0, a genetic programming system for semi-automatica...