270 search results - page 33 / 54 » Constraint relaxation in approximate linear programs |
CP
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
A well studied special case of bin packing is the 3-partition problem, where n items of size > 1 4 have to be packed in a minimum number of bins of capacity one. The famous Kar...
ICASSP
2011
IEEE
13 years 2 months ago
2011
IEEE
—The optimum multiuser detection (OMD) is a discrete (binary) optimization. The previously developed approaches often relax it by a semi-definite program (SDP) and then employ r...
COCOON
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. The infrastructure for mobile distributed tasks is often formed by cellular networks. One of the major issues in such networks is interference. In this paper we tackle in...
LPAR
2010
Springer
13 years 8 months ago
2010
Springer
Craig interpolation has become a key ingredient in many symbolic model checkers, serving as an approximative replacement for expensive quantifier elimination. In this paper, we foc...