270 search results - page 53 / 54 » Constraint relaxation in approximate linear programs |
FOCS
2009
IEEE
14 years 16 days ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
IPPS
2009
IEEE
14 years 13 days 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...
ESA
2010
Springer
13 years 6 months ago
2010
Springer
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
INFOCOM
2012
IEEE
11 years 8 months ago
2012
IEEE
Abstract—Network power consumption can be reduced considerably by adapting link data rates to their offered traffic loads. In this paper, we exploit how to leverage rate adaptat...
RSS
2007
13 years 7 months ago
2007
— Multi-robot systems require efficient and accurate planning in order to perform mission-critical tasks. However, algorithms that find the optimal solution are usually computa...