Sciweavers

251 search results - page 4 / 51
» Distributed subgradient projection algorithm for convex opti...
Sort
View
JSAC
2006
180views more  JSAC 2006»
13 years 9 months ago
A Tutorial on Decomposition Methods for Network Utility Maximization
A systematic understanding of the decomposability structures in network utility maximization is key to both resource allocation and functionality allocation. It helps us obtain the...
Daniel Pérez Palomar, Mung Chiang
INFOCOM
2011
IEEE
13 years 1 months ago
Consort: Node-Constrained Opportunistic Routing in wireless mesh networks
— Opportunistic routing is proposed to improve the performance of wireless networks by exploiting the broadcast nature and spatial diversity of the wireless medium. In this paper...
Xi Fang, Dejun Yang, Guoliang Xue
TIT
2010
101views Education» more  TIT 2010»
13 years 4 months ago
Separation principles in wireless networking
A general wireless networking problem is formulated whereby end-to-end user rates, routes, link capacities, transmitpower, frequency and power resources are jointly optimized acros...
Alejandro Ribeiro, Georgios B. Giannakis
CDC
2010
IEEE
176views Control Systems» more  CDC 2010»
13 years 4 months ago
Random projection algorithms for convex set intersection problems
The focus of this paper is on the set intersection problem for closed convex sets admitting projection operation in a closed form. The objective is to investigate algorithms that w...
Angelia Nedic
CORR
2011
Springer
177views Education» more  CORR 2011»
13 years 4 months ago
A Truthful Randomized Mechanism for Combinatorial Public Projects via Convex Optimization
In Combinatorial Public Projects, there is a set of projects that may be undertaken, and a set of selfinterested players with a stake in the set of projects chosen. A public plann...
Shaddin Dughmi