Sciweavers

920 search results - page 61 / 184
» Generating Satisfiable Problem Instances
Sort
View
ICDT
2010
ACM
193views Database» more  ICDT 2010»
14 years 1 months ago
Data correspondence, exchange and repair
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 ...
Gösta Grahne, Adrian Onet
JSAT
2008
122views more  JSAT 2008»
13 years 10 months ago
SAT Algorithms for Colouring Some Special Classes of Graphs: Some Theoretical and Experimental Results
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...
Sriyankar Acharyya
ICCAD
2002
IEEE
227views Hardware» more  ICCAD 2002»
14 years 7 months ago
Generic ILP versus specialized 0-1 ILP: an update
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...
Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Kare...
AAAI
2008
14 years 1 months ago
Studies in Solution Sampling
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...
Vibhav Gogate, Rina Dechter
SIGMOD
2008
ACM
150views Database» more  SIGMOD 2008»
14 years 11 months ago
Query biased snippet generation in XML search
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 ...
Yu Huang, Ziyang Liu, Yi Chen