2694 search results - page 126 / 539 » Fully Distributed Algorithms for Convex Optimization Problem... |
145
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
We study randomized variants of two classical algorithms: coordinate descent for systems of linear equations and iterated projections for systems of linear inequalities. Expanding...
178
click to vote
ATAL
2009
Springer
15 years 11 months ago
2009
Springer
Previous work in multiagent coordination has addressed the challenge of planning in domains where agents must optimize a global goal, while satisfying local resource constraints. ...
142
click to vote
INFOCOM
2007
IEEE
15 years 11 months ago
2007
IEEE
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
212
click to vote
IPCO
2010
15 years 6 months ago
2010
We introduce the framework of polyhedral branching systems that can be used in order to construct extended formulations for polyhedra by combining extended formulations for other p...
147
click to vote
JSAC
2006
15 years 4 months ago
2006
Abstract--The current framework of network utility maximization for rate allocation and its price-based algorithms assumes that each link provides a fixed-size transmission "p...