470 search results - page 31 / 94 » Tabu Search for SAT |
93
Voted
ISMIS
1999
Springer
15 years 5 months ago
1999
Springer
In this paper, a new heuristic that can be grafted to many of the most e cient branching strategies for Davis and Putnam procedures for SAT is described. This heuristic gives a hig...
IJCNN
2007
IEEE
15 years 7 months ago
2007
IEEE
— Solvers for the Boolean satisfiability problem are an important base technology for many applications. The most efficient SAT solvers for industrial applications are based on...
104
click to vote
CCE
2008
15 years 24 days ago
2008
We present a novel approach for solving different design problems related to single products in multipurpose batch plants: the selection of one production line out of several avai...
114
Voted
SAT
2004
Springer
15 years 6 months ago
2004
Springer
We present a scheduler with a web interface for generating fair game schedules of a tournament. The tournament can be either single or double round-robin or something in between. T...
112
Voted
AUSAI
2007
Springer
15 years 4 months ago
2007
Springer
Many real-world problems are over-constrained and require search techniques adapted to optimising cost functions rather than searching for consistency. This makes the MAX-SAT probl...