589 search results - page 15 / 118 » Local Search Algorithms for SAT: An Empirical Evaluation |
ACL
2008
13 years 8 months ago
2008
We present a novel framework for the discovery and representation of general semantic relationships that hold between lexical items. We propose that each such relationship can be ...
AI
2003
Springer
14 years 19 days ago
2003
Springer
MAX-SAT, the optimisation variant of the satisfiability problem in propositional logic, is an important and widely studied combinatorial optimisation problem with applications in ...
FPL
2003
Springer
14 years 18 days ago
2003
Springer
Local search methods such as WSAT have proven to be successful for solving SAT problems. In this paper, we propose two host-FPGA (Field Programmable Gate Array) co-implementations,...
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...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The stable marriage (SM) problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more genera...