497 search results - page 42 / 100 » Approximating max-min linear programs with local algorithms |
107
Voted
SIAMJO
2008
14 years 11 months ago
2008
For the problem of solving maximal monotone inclusions, we present a rather general class of algorithms, which contains hybrid inexact proximal point methods as a special case and ...
TMC
2011
14 years 6 months ago
2011
—This paper describes new algorithms for throughput optimization in a mobile backbone network. This hierarchical communication framework combines mobile backbone nodes, which hav...
118
click to vote
JAIR
2010
14 years 10 months ago
2010
Decentralized planning in uncertain environments is a complex task generally dealt with by using a decision-theoretic approach, mainly through the framework of Decentralized Parti...
HM
2009
Springer
15 years 4 months ago
2009
Springer
We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....
103
click to vote
CVPR
2010
IEEE
14 years 9 months ago
2010
IEEE
The calculation of a low-rank approximation of a matrix is a fundamental operation in many computer vision applications. The workhorse of this class of problems has long been the ...