72 search results - page 8 / 15 » Conflict Analysis in Search Algorithms for Satisfiability |
GECCO
2007
Springer
15 years 1 months ago
2007
Springer
This paper presents a novel approach for a free structure analog circuit design using Genetic Algorithms (GA). A major problem in a free structure circuit is its sensitivity calcu...
CORR
2006
Springer
14 years 10 months ago
2006
Springer
: A local search algorithm operating on an instance of a Boolean constraint satisfaction problem (in particular, k-SAT) can be viewed as a stochastic process traversing successive ...
SIGIR
2006
ACM
15 years 3 months ago
2006
ACM
Many searches on the web have a transactional intent. We argue that pages satisfying transactional needs can be distinguished from the more common pages that have some information...
WWW
2008
ACM
15 years 10 months ago
2008
ACM
Due to the rapid growth in the size of the web, web search engines are facing enormous performance challenges. The larger engines in particular have to be able to process tens of ...
SIAMCOMP
2002
14 years 9 months ago
2002
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, build...