Sciweavers

2095 search results - page 57 / 419
» Improved pebbling bounds
Sort
View
WAOA
2004
Springer
127views Algorithms» more  WAOA 2004»
14 years 3 months ago
Better Bounds for Minimizing SONET ADMs
SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET /WDM rings. The number of SONET ADMs required by a set of traffic streams is determined by the routing and...
Leah Epstein, Asaf Levin
IPL
2008
95views more  IPL 2008»
13 years 10 months ago
Approximating maximum satisfiable subsystems of linear equations of bounded width
We consider the problem known as MAX-SATISFY: given a system of m linear equations over the rationals, find a maximum set of equations that can be satisfied. Let r be the width of...
Zeev Nutov, Daniel Reichman
MOC
1998
106views more  MOC 1998»
13 years 9 months ago
Class number bounds and Catalan's equation
We improve a criterion of Inkeri and show that if there is a solution to Catalan’s equation xp − yq = ±1,(1) with p and q prime numbers greater than 3 and both congruent to 3 ...
Ray Steiner
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