2976 search results - page 130 / 596 » On the bounded integer programming |
136
click to vote
WIOPT
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract--Power allocation is a promising approach for optimizing the performance of mobile radio systems in interference channels. In the present paper, the non-convex objective f...
113
click to vote
EUSFLAT
2009
14 years 10 months ago
2009
Abstract-- In this paper, we deal with the production and transportation planning of a household appliances manufacturer that has production facilities and central stores for resel...
77
Voted
STOC
2003
ACM
16 years 28 days ago
2003
ACM
A d-regular graph has largest or first (adjacency matrix) eigenvalue 1 = d. In this paper we show the following conjecture of Alon. Fix an integer d > 2 and a real > 0. Then...
98
Voted
CASC
2009
Springer
15 years 7 months ago
2009
Springer
This work addresses the problem of computing a certified ǫ-approximation of all real roots of a square-free integer polynomial. We proof an upper bound for its bit complexity, b...
118
Voted
ACSC
2005
IEEE
15 years 6 months ago
2005
IEEE
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...