Sciweavers

470 search results - page 42 / 94
» Tabu Search for SAT
Sort
View
83
Voted
COCOON
1998
Springer
15 years 5 months ago
Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT
Mutsunori Yagiura, Toshihide Ibaraki
CORR
2008
Springer
69views Education» more  CORR 2008»
15 years 24 days ago
Phase transition for Local Search on planted SAT
Andrei A. Bulatov, Evgeny S. Skvortsov
130
Voted
TIT
2008
107views more  TIT 2008»
15 years 18 days ago
Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers
The term binary combinatorial Gray code refers to a list of binary words such that the Hamming distance between two neighboring words is one and the list satisfies some additional ...
Igor Zinovik, Daniel Kroening, Yury Chebiryak
101
Voted
AMAI
2004
Springer
15 years 6 months ago
Warped Landscapes and Random Acts of SAT Solving
Recent dynamic local search (DLS) algorithms such as SAPS are amongst the state-of-the-art methods for solving the propositional satisfiability problem (SAT). DLS algorithms modi...
Dave A. D. Tompkins, Holger H. Hoos
JAMDS
2002
155views more  JAMDS 2002»
15 years 11 days ago
A new heuristic for the quadratic assignment problem
We propose a new heuristic for the solution of the quadratic assignment problem. The heuristic combines ideas from tabu search and genetic algorithms. Run times are very short comp...
Zvi Drezner