3875 search results - page 355 / 775 » Approximation algorithms for the 0-extension problem |
157
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
We use convex relaxation techniques to produce lower bounds on the optimal value of subset selection problems and generate good approximate solutions. We then explicitly bound the...
183
click to vote
DAM
2008
15 years 7 months ago
2008
We study a variant of the pickup-and-delivery problem (PDP) in which the objects that have to be transported can be reloaded at most d times, for a given d N. This problem is kno...
196
click to vote
TASE
2010
IEEE
15 years 1 months ago
2010
IEEE
Robots operating in a workspace can localize themselves by querying nodes of a sensor-network deployed in the same workspace. This paper addresses the problem of computing the min...
196
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Received signal strength (RSS)-based single source localization when there is not a prior knowledge about the transmit power of the source is investigated. Because of nonconvex be...
175
click to vote
WWW
2008
ACM
16 years 7 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...