920 search results - page 61 / 184 » Generating Satisfiable Problem Instances |
ICDT
2010
ACM
14 years 1 months ago
2010
ACM
Checking the correspondence between two or more database instances and enforcing it is a procedure widely used in practice without however having been explored from a theoretical ...
JSAT
2008
13 years 10 months ago
2008
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
ICCAD
2002
IEEE
14 years 7 months ago
2002
IEEE
Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further use...
AAAI
2008
14 years 1 months ago
2008
We introduce novel algorithms for generating random solutions from a uniform distribution over the solutions of a boolean satisfiability problem. Our algorithms operate in two pha...
SIGMOD
2008
ACM
14 years 11 months ago
2008
ACM
Snippets are used by almost every text search engine to complement ranking scheme in order to effectively handle user searches, which are inherently ambiguous and whose relevance ...