Sciweavers

882 search results - page 5 / 177
» Local Search for Very Large SAT Problems
Sort
View
TIME
2002
IEEE
14 years 8 days ago
Applying Local Search to Temporal Reasoning
Local search techniques have attracted considerable interest in the Artificial Intelligence (AI) community since the development of GSAT [9] and the min-conflicts heuristic [5] ...
John Thornton, Matthew Beaumont, Abdul Sattar, Mic...
INFORMS
2007
77views more  INFORMS 2007»
13 years 7 months ago
Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem
Ravindra K. Ahuja, Krishna C. Jha, James B. Orlin,...
JAR
2000
149views more  JAR 2000»
13 years 7 months ago
Guided Local Search for Solving SAT and Weighted MAX-SAT Problems
In this paper, we show how Guided Local Search (GLS) can be applied to the SAT problem and show how the resulting algorithm can be naturally extended to solve the weighted MAX-SAT ...
Patrick Mills, Edward P. K. Tsang
AUSAI
2003
Springer
14 years 18 days ago
Estimating Problem Metrics for SAT Clause Weighting Local Search
Wayne J. Pullan, Liang Zhao, John Thornton
SAT
2004
Springer
106views Hardware» more  SAT 2004»
14 years 22 days ago
Local Search with Bootstrapping
We propose and study a technique to improve the performance of those local-search SAT solvers that proceed by executing a prespecified number of tries, each starting with an eleme...
Lengning Liu, Miroslaw Truszczynski