3049 search results - page 160 / 610 » On the Convergence of Bound Optimization Algorithms |
168
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
We resolve an open question raised by Feige & Scheideler by showing that the best known approximation algorithm for flow shops is essentially tight with respect to the used low...
154
click to vote
CISS
2008
IEEE
16 years 27 days ago
2008
IEEE
— It has been known since the early 1990s that backpressure-type algorithms for communication networks (such as the Max-Weight algorithm) can be used to approximately solve stati...
194
click to vote
FOCS
2008
IEEE
16 years 26 days ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
146
click to vote
WWW
2004
ACM
16 years 7 months ago
2004
ACM
This paper presents an algorithm to bound the bandwidth of a Web crawler. The crawler collects statistics on the transfer rate of each server to predict the expected bandwidth use...
161
click to vote
NIPS
2007
15 years 7 months ago
2007
We give a new class of outer bounds on the marginal polytope, and propose a cutting-plane algorithm for efficiently optimizing over these constraints. When combined with a concav...