666 search results - page 29 / 134 » The Pipelined Set Cover Problem |
123
click to vote
SWAT
2004
Springer
15 years 10 months ago
2004
Springer
The standard dynamic programming solution to finding k-medians on a line with n nodes requires O(kn2 ) time. Dynamic programming speedup techniques, e.g., use of the quadrangle i...
129
click to vote
IPPS
2009
IEEE
15 years 11 months ago
2009
IEEE
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
125
click to vote
ICRA
2005
IEEE
15 years 10 months ago
2005
IEEE
— In this paper we address the problem of generating a motion strategy to find an object in a known 3-D environment as quickly as possible on average. We use a sampling scheme t...
138
click to vote
MST
2010
15 years 3 months ago
2010
We study the following variant of the bin covering problem. We are given a set of unit sized items, where each item has a color associated with it. We are given an integer paramet...
122
click to vote
IPCO
2007
15 years 6 months ago
2007
Let A be the edge-node incidence matrix of a bipartite graph G = (U, V ; E), I be a subset the nodes of G, and b be a vector such that 2b is integral. We consider the following mi...