72 search results - page 2 / 15 » Conflict Analysis in Search Algorithms for Satisfiability |
ADVAI
2010
12 years 12 months ago
2010
The focus of warfare has shifted from the Industrial Age to the Information Age, as encapsulated by the term Network Enabled Capability. This emphasises information sharing, comma...
CCECE
2006
IEEE
13 years 11 months ago
2006
IEEE
Several approaches have been proposed to accelerate the NP-complete Boolean Satisfiability problem (SAT) using reconfigurable computing. We present an FPGA based clause evaluator,...
CIKM
2008
Springer
13 years 7 months ago
2008
Springer
Finding biological entities (such as genes or proteins) that satisfy certain conditions from texts is an important and challenging task in biomedical information retrieval and tex...
FMCAD
2004
Springer
13 years 9 months ago
2004
Springer
This work presents a memory-efficient All-SAT engine which, given a propositional formula over sets of important and non-important variables, returns the set of all the assignments...
ALMOB
2007
13 years 5 months ago
2007
Background: Neighbor-Net is a novel method for phylogenetic analysis that is currently being widely used in areas such as virology, bacteriology, and plant evolution. Given an inp...