470 search results - page 56 / 94 » Tabu Search for SAT |
CP
2004
Springer
13 years 11 months ago
2004
Springer
Symmetry in constraint problems can be exploited to greatly improve search performance. A form of symmetry that has been the subject of considerable research is value interchangeab...
ICTAI
2002
IEEE
14 years 18 days ago
2002
IEEE
(Appears as a regular paper in the proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), IEEE Computer Society, Washington D.C. Nov. 2002, p...
ISAMI
2010
13 years 5 months ago
2010
Abstract Medical data sets consist of a huge amount of data organized in instances, where each one contains several attributes. The quality of the models obtained from a database s...
SAT
2005
Springer
14 years 1 months ago
2005
Springer
Many current local search algorithms for SAT fall into one of two classes. Random walk algorithms such as Walksat/SKC, Novelty+ and HWSAT are very successful but can be trapped for...
CONSTRAINTS
2007
13 years 7 months ago
2007
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...