1647 search results - page 142 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
123
click to vote
SECON
2010
IEEE
15 years 2 months ago
2010
IEEE
Anypath routing has been proposed to improve the performance of unreliable wireless networks by exploiting the spatial diversity and broadcast nature of the wireless medium. In thi...
209
click to vote
ARITH
2011
IEEE
14 years 5 months ago
2011
IEEE
—We consider the problem of short division — i.e., approximate quotient — of multiple-precision integers. We present ready-to-implement algorithms that yield an approximation...
144
click to vote
ANTSW
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. For solving combinatorial optimisation problems, exact methods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation ...
151
click to vote
TOC
2010
14 years 11 months ago
2010
: We consider the Submodular Welfare Problem where we have m items and n players with given utility functions wi : 2[m] R+. The utility functions are assumed to be monotone and su...
145
Voted
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...