791 search results - page 92 / 159 » Approximating the Maximum Sharing Problem |
COMCOM
2004
13 years 7 months ago
2004
In multihop wavelength division multiplexing systems, a connection between two communication nodes consists of one or more lightpaths. A wavelength conversion is required at the j...
INFOCOM
2012
IEEE
11 years 10 months ago
2012
IEEE
—In this paper we present a methodology for the design of congestion control protocols for background data transfers that have a minimal delay impact on short TCP transfers and c...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
Most models for online advertising assume that an advertiser's value from winning an ad auction, which depends on the clickthrough rate or conversion rate of the advertisemen...
NIPS
2007
13 years 9 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
DAM
2007
13 years 7 months ago
2007
In the partially-ordered knapsack problem (POK) we are given a set N of items and a partial order ≺P on N. Each item has a size and an associated weight. The objective is to pac...