Sciweavers

18 search results - page 3 / 4
» Maximizing a Submodular Set Function Subject to a Matroid Co...
Sort
View
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
14 years 3 months ago
Truthful Mechanisms via Greedy Iterative Packing
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is ...
Chandra Chekuri, Iftah Gamzu
JSAC
2011
82views more  JSAC 2011»
13 years 3 months ago
Optimal Cognitive Access of Markovian Channels under Tight Collision Constraints
Abstract—The problem of cognitive access of channels of primary users by a secondary user is considered. The transmissions of primary users are modeled as independent continuous-...
Xin Li, Qianchuan Zhao, Xiaohong Guan, Lang Tong
MP
2010
172views more  MP 2010»
13 years 7 months ago
Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
In this paper, we consider approximation algorithms for optimizing a generic multi-variate homogeneous polynomial function, subject to homogeneous quadratic constraints. Such opti...
Simai He, Zhening Li, Shuzhong Zhang
IJDMBC
2010
115views more  IJDMBC 2010»
13 years 3 months ago
Near Optimum Power Control and Precoding under Fairness Constraints in Network MIMO Systems
Abstract--We consider the problem of setting the uplink signalto-noise-and-interference (SINR) target and allocating transmit powers for mobile stations in multicell spatial multip...
Gábor Fodor, Mikael Johansson, Pablo Soldat...
INFOCOM
2002
IEEE
14 years 1 months ago
Optimal Rate Allocation and Traffic Splits for Energy Efficient Routing in Ad Hoc Networks
Abstract— In this paper, we address the problem of providing traffic quality of service and energy efficiency in ad hoc wireless networks. We consider a network that is shared ...
Vikram Srinivasan, Carla-Fabiana Chiasserini, Pava...