882 search results - page 52 / 177 » Local Search for Very Large SAT Problems |
CPM
2009
Springer
15 years 6 months ago
2009
Springer
A classical measure of similarity between strings is the length of the longest common subsequence(LCS) between the two given strings. The search for efficient algorithms for findi...
106
click to vote
ECCC
2007
14 years 11 months ago
2007
Satisfiability algorithms have become one of the most practical and successful approaches for solving a variety of real-world problems, including hardware verification, experime...
SODA
2008
ACM
15 years 1 months ago
2008
ACM
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...
112
click to vote
ICCS
2003
Springer
15 years 5 months ago
2003
Springer
In many areas of design search and optimisation one needs to utilize Computational Fluid Dynamics (CFD) methods in order to obtain numerical solution of the flow field in and/or ...
IJCAI
2007
15 years 1 months ago
2007
In this paper we present a general logical framework for (weighted) MAX-SAT problem, and study properties of inference rules for branch and bound MAX-SAT solver. Several rules, wh...