Sciweavers

539 search results - page 15 / 108
» An Improved Upper Bound for SAT
Sort
View
COMPGEOM
2010
ACM
14 years 17 days ago
Improving the first selection lemma in R3
We present new bounds on the first selection lemma in R3 . This makes progress on the open problems of Bukh, Matoušek and Nivash [6] and Boros-Füredi [4] for the three-dimensio...
Abdul Basit, Nabil H. Mustafa, Saurabh Ray, Sarfra...
SAT
2009
Springer
113views Hardware» more  SAT 2009»
14 years 2 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...
HASE
2007
IEEE
14 years 1 months ago
SyncProbe: Providing Assurance of Message Latency through Predictive Monitoring of Internet Paths
SyncProbe improves the end-to-end predictability of distributed systems by providing applications with a real-time estimate of the maximum expected message delay (upper bound on c...
Jawwad Shamsi, Monica Brockmeyer
JCT
2007
134views more  JCT 2007»
13 years 7 months ago
Improved Delsarte bounds for spherical codes in small dimensions
ABSTRACT. We present an extension of the Delsarte linear programming method for spherical codes. For several dimensions it yields improved upper bounds including some new bounds on...
Florian Pfender
CORR
2010
Springer
76views Education» more  CORR 2010»
13 years 7 months ago
Improved Bounds on Restricted Isometry Constants for Gaussian Matrices
The Restricted Isometry Constants (RIC) of a matrix A measures how close to an isometry is the action of A on vectors with few nonzero entries, measured in the 2 norm. Specifically...
Bubacarr Bah, Jared Tanner