Sciweavers

Share
JSAT
2008
122views more  JSAT 2008»
9 years 7 months ago
SAT Algorithms for Colouring Some Special Classes of Graphs: Some Theoretical and Experimental Results
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
Sriyankar Acharyya
AAAI
1997
9 years 8 months ago
Tabu Search for SAT
In this paper, tabu search for SAT is investigated from an experimental point of view. To this end, TSAT, a basic tabu search algorithm for SAT, is introduced and compared with Se...
Bertrand Mazure, Lakhdar Sais, Éric Gr&eacu...
EVOW
2008
Springer
9 years 8 months ago
A Conflict Tabu Search Evolutionary Algorithm for Solving Constraint Satisfaction Problems
This paper introduces a hybrid Tabu Search - Evolutionary Algorithm for solving the binary constraint satisfaction problem, called CTLEA. A continuation of an earlier introduced al...
Bart G. W. Craenen, Ben Paechter
books