Sciweavers

2944 search results - page 110 / 589
» Improving Bound Propagation
Sort
View
WADS
2005
Springer
95views Algorithms» more  WADS 2005»
14 years 3 months ago
Improved Combinatorial Group Testing for Real-World Problem Sizes
We study practically efficient methods for performing combinatorial group testing. We present efficient non-adaptive and two-stage combinatorial group testing algorithms, which i...
David Eppstein, Michael T. Goodrich, Daniel S. Hir...
CSL
1995
Springer
14 years 1 months ago
Improved Decision Procedures for the Modal Logics K, T, and S4
We propose so called contraction free sequent calculi for the three prominent modal logics K, T, and S4. Deduction search in these calculi is shown to provide more efficient decisi...
Jörg Hudelmaier
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
14 years 4 months ago
Improved Approximation of Linear Threshold Functions
We prove two main results on how arbitrary linear threshold functions f(x) = sign(w · x − θ) over the n-dimensional Boolean hypercube can be approximated by simple threshold f...
Ilias Diakonikolas, Rocco A. Servedio
ANCS
2005
ACM
14 years 3 months ago
Group round robin: improving the fairness and complexity of packet scheduling
We present Group Round-Robin (GRR) scheduling, a hybrid fair packet scheduling framework based on a grouping strategy that narrows down the traditional trade-off between fairness ...
Bogdan Caprita, Jason Nieh, Wong Chun Chan
ICC
2009
IEEE
198views Communications» more  ICC 2009»
14 years 4 months ago
On the Capacity Region of the Gaussian Multiple Access Channel with Noisy Feedback
—We provide a new outer bound on the capacity region of the two-user Gaussian multiple access channel (MAC) with AWGN-corrupted feedback. Our outer bound is based on the idea of ...
Ravi Tandon, Sennur Ulukus