Sciweavers

2996 search results - page 440 / 600
» Numberings and Randomness
Sort
View
SAT
2009
Springer
113views Hardware» more  SAT 2009»
16 years 1 months ago
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
Abstract. We offer a new understanding of some aspects of practical SAT-solvers that are based on DPLL with unit-clause propagation, clause-learning, and restarts. On the theoreti...
Albert Atserias, Johannes Klaus Fichte, Marc Thurl...
SAT
2009
Springer
91views Hardware» more  SAT 2009»
16 years 1 months ago
VARSAT: Integrating Novel Probabilistic Inference Techniques with DPLL Search
Probabilistic inference techniques can be used to estimate variable bias, or the proportion of solutions to a given SAT problem that fix a variable positively or negatively. Metho...
Eric I. Hsu, Sheila A. McIlraith
COMPGEOM
2009
ACM
16 years 1 months ago
Computing hereditary convex structures
Color red and blue the n vertices of a convex polytope P in R3 . Can we compute the convex hull of each color class in o(n log n)? What if we have χ > 2 colors? What if the co...
Bernard Chazelle, Wolfgang Mulzer
IWCMC
2009
ACM
16 years 1 months ago
Quantized transmit beamforming with antenna selection in a MIMO channel
For a point-to-point multi-input multi-output (MIMO) wireless channel, we propose a feedback scheme, which consists of transmit-antenna selection algorithm and beamforming quantiz...
Wiroonsak Santipach
RECSYS
2009
ACM
16 years 1 months ago
Using a trust network to improve top-N recommendation
Top-N item recommendation is one of the important tasks of recommenders. Collaborative filtering is the most popular approach to building recommender systems which can predict ra...
Mohsen Jamali, Martin Ester