3475 search results - page 103 / 695 » Backbones in Optimization and Approximation |
132
click to vote
WG
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We consider a generalization of the classical max-cut problem where two objective functions are simultaneously considered. We derive some theorems on the existence and th...
141
click to vote
ISMVL
1994
IEEE
15 years 10 months ago
1994
IEEE
The problem of approximating a propositional calculus is to nd many-valued logics which are sound for the calculus (i.e., all theorems of the calculus are tautologies) with as few...
170
click to vote
TCS
2008
15 years 6 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
167
click to vote
ICCAD
2001
IEEE
16 years 3 months ago
2001
IEEE
As system integration evolves and tighter design constraints must be met, it becomes necessary to account for the non-ideal behavior of all the elements in a system. Certain devic...
163
click to vote
INFOCOM
2009
IEEE
16 years 28 days ago
2009
IEEE
—In this paper we propose to construct an flexible delay line with maximum delay d by parallel non-overtaking delay lines. We show that for a fixed number of non-overtaking del...