206 search results - page 10 / 42 » A branch-and-bound algorithm for hard multiple knapsack prob... |
TALG
2008
14 years 11 months ago
2008
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines...
PODS
2008
ACM
15 years 12 months ago
2008
ACM
We consider a fundamental flow maximization problem that arises during the evaluation of multiple overlapping queries defined on a data stream, in a heterogenous parallel environm...
107
click to vote
ISAAC
2010
Springer
14 years 9 months ago
2010
Springer
We consider the problem of finding a sparse multiple of a polynomial. Given f F[x] of degree d, and a desired sparsity t, our goal is to determine if there exists a multiple h F[...
102
click to vote
MOBIHOC
2009
ACM
16 years 8 days ago
2009
ACM
Node mobility and end-to-end disconnections in Delay Tolerant Networks (DTNs) greatly impair the effectiveness of data dissemination. Although social-based approaches can be used ...
AAAI
2000
15 years 1 months ago
2000
We present a novel algorithm for computing the optimal winning bids in a combinatorial auction (CA), that is, an auction in which bidders bid for bundles of goods. All previously ...