Sciweavers

3 search results - page 1 / 1
» Additive versus Multiplicative Clause Weighting for SAT
Sort
View
AAAI
2004
14 years 8 days ago
Additive versus Multiplicative Clause Weighting for SAT
This paper examines the relative performance of additive and multiplicative clause weighting schemes for propositional satisfiability testing. Starting with one of the most recent...
John Thornton, Duc Nghia Pham, Stuart Bain, Valnir...
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...
ICASSP
2011
IEEE
13 years 2 months ago
Content preference estimation in online social networks: Message passing versus sparse reconstruction on graphs
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...
Jacob Chakareski