Sciweavers

22 search results - page 4 / 5
» Bounds on the Quantum Satisfiability Threshold
Sort
View
EDBT
2006
ACM
120views Database» more  EDBT 2006»
14 years 5 months ago
Query Planning in the Presence of Overlapping Sources
Navigational queries on Web-accessible life science sources pose unique query optimization challenges. The objects in these sources are interconnected to objects in other sources, ...
Jens Bleiholder, Samir Khuller, Felix Naumann, Lou...
FMICS
2006
Springer
13 years 9 months ago
SAT-Based Verification of LTL Formulas
Abstract. Bounded model checking (BMC) based on satisfiability testing (SAT) has been introduced as a complementary technique to BDDbased symbolic model checking of LTL properties ...
Wenhui Zhang
ATAL
2010
Springer
13 years 6 months ago
Aggregating preferences in multi-issue domains by using maximum likelihood estimators
In this paper, we study a maximum likelihood estimation (MLE) approach to preference aggregation and voting when the set of alternatives has a multi-issue structure, and the voter...
Lirong Xia, Vincent Conitzer, Jérôme ...
CORR
2006
Springer
127views Education» more  CORR 2006»
13 years 5 months ago
Space Division Multiple Access with a Sum Feedback Rate Constraint
On a multiantenna broadcast channel, simultaneous transmission to multiple users by joint beamforming and scheduling is capable of achieving high throughput, which grows double log...
Kaibin Huang, Robert W. Heath Jr., Jeffrey G. Andr...
CORR
2006
Springer
123views Education» more  CORR 2006»
13 years 5 months ago
Counting good truth assignments of random k-SAT formulae
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
Andrea Montanari, Devavrat Shah