1040 search results - page 146 / 208 » Rounding algorithms for covering problems |
147
click to vote
WWW
2009
ACM
16 years 5 months ago
2009
ACM
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
138
click to vote
ICCV
2001
IEEE
16 years 6 months ago
2001
IEEE
We cast the problem of multiframe stereo reconstruction of a smooth shape as the global region segmentation of a collection of images of the scene. Dually, the problem of segmenti...
127
click to vote
GECCO
2010
Springer
15 years 8 months ago
2010
Springer
This paper reports about the application of a new variant of multiobjective Mixed-Integer Evolution Strategy to a warehouse design optimization problem. The algorithm is able to d...
153
click to vote
DIALM
2007
ACM
15 years 8 months ago
2007
ACM
We consider the following channel assignment problem in multiradio multi-channel wireless networks: Given a wireless network where k orthogonal channels are available and each nod...
145
click to vote
SODA
2012
ACM
13 years 6 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...