Sciweavers

428 search results - page 50 / 86
» FPGA-Based SAT Solver
Sort
View
AAAI
2008
15 years 3 days ago
Backdoor Trees
The surprisingly good performance of modern satisfiability (SAT) solvers is usually explained by the existence of a certain "hidden structure" in real-world instances. W...
Marko Samer, Stefan Szeider
IJCAI
2003
14 years 11 months ago
Combining Two Local Search Approaches to Hypergraph Partitioning
We study leading-edge local search heuristics for balanced hypergraph partitioning and Boolean satisfiability, intending the generalization of such heuristics beyond their origina...
Arathi Ramani, Igor L. Markov
AI
2010
Springer
14 years 10 months ago
Extended clause learning
The past decade has seen clause learning as the most successful algorithm for SAT instances arising from real-world applications. This practical success is accompanied by theoreti...
Jinbo Huang
JMLR
2010
128views more  JMLR 2010»
14 years 4 months ago
Learning Causal Structure from Overlapping Variable Sets
We present an algorithm name cSAT+ for learning the causal structure in a domain from datasets measuring different variable sets. The algorithm outputs a graph with edges correspo...
Sofia Triantafilou, Ioannis Tsamardinos, Ioannis G...
TACAS
2012
Springer
277views Algorithms» more  TACAS 2012»
13 years 5 months ago
Proving Reachability Using FShell - (Competition Contribution)
FShell is an automated white-box test-input generator for C programs, computing test data with respect to user-specified code coverage criteria. The pillars of FShell are the decl...
Andreas Holzer, Daniel Kroening, Christian Schallh...