Sciweavers

2018 search results - page 121 / 404
» Code Normal Forms
Sort
View
MOBICOM
2009
ACM
15 years 9 months ago
Achievable throughput of multiple access spectrum systems based on cognitive relay
Cognitive relays form a special cooperation relationship among users in cognitive radio networks, and help increase the transmission rates of both primary users and secondary user...
Wei Wang, Baochun Li, Li Yu
126
Voted
CORR
2008
Springer
126views Education» more  CORR 2008»
15 years 2 months ago
Interference Channels with Correlated Receiver Side Information
The problem of joint source-channel coding in transmitting independent sources over interference channels with correlated receiver side information is studied. When each receiver ...
Nan Liu, Deniz Gündüz, Andrea J. Goldsmi...
120
Voted
DAC
2009
ACM
16 years 3 months ago
Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...
Himanshu Jain, Edmund M. Clarke
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
16 years 2 months ago
Narrow proofs may be spacious: separating space and width in resolution
The width of a resolution proof is the maximal number of literals in any clause of the proof. The space of a proof is the maximal number of clauses kept in memory simultaneously if...
Jakob Nordström
ICTAI
2009
IEEE
15 years 9 months ago
Local Autarkies Searching for the Dynamic Partition of CNF Formulae
In this paper an original dynamic partition of formulae in Conjunctive Normal Form (CNF) is presented. It is based on the autarky concept first introduced by Monien and Speckenme...
Éric Grégoire, Bertrand Mazure, Lakh...