Sciweavers

3096 search results - page 123 / 620
» The Generalized FITC Approximation
Sort
View
CPM
2005
Springer
116views Combinatorics» more  CPM 2005»
14 years 2 months ago
Exact and Approximation Algorithms for DNA Tag Set Design
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...
Ion I. Mandoiu, Dragos Trinca
MFCS
2005
Springer
14 years 2 months ago
Approximating Reversal Distance for Strings with Bounded Number of Duplicates
For a string A = a1 . . . an, a reversal ρ(i, j), 1 ≤ i < j ≤ n, transforms the string A into a string A = a1 . . . ai−1ajaj−1 . . . aiaj+1 . . . an, that is, the reve...
Petr Kolman
GLVLSI
2003
IEEE
219views VLSI» more  GLVLSI 2003»
14 years 2 months ago
Buffer sizing for minimum energy-delay product by using an approximating polynomial
This paper first presents an accurate and efficient method of estimating the short circuit energy dissipation and the output transition time of CMOS buffers. Next the paper descri...
Chang Woo Kang, Soroush Abbaspour, Massoud Pedram
FSTTCS
2006
Springer
14 years 16 days ago
Approximation Algorithms for 2-Stage Stochastic Optimization Problems
Abstract. Stochastic optimization is a leading approach to model optimization problems in which there is uncertainty in the input data, whether from measurement noise or an inabili...
Chaitanya Swamy, David B. Shmoys
CORR
2008
Springer
76views Education» more  CORR 2008»
13 years 9 months ago
An Efficient Algorithm for a Sharp Approximation of Universally Quantified Inequalities
This paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified ine...
Alexandre Goldsztejn, Claude Michel, Michel Rueher