Sciweavers

6 search results - page 1 / 2
» Maximizing Non-Linear Concave Functions in Fixed Dimension
Sort
View
FOCS
1992
IEEE
13 years 9 months ago
Maximizing Non-Linear Concave Functions in Fixed Dimension
Consider a convex set P in IRd and a piecewise polynomial concave function F: P IR. Let A be an algorithm that given a point x IRd computes F(x) if x P, or returns a concave po...
Sivan Toledo
NETWORKS
2008
13 years 4 months ago
Price competition with elastic traffic
In this paper, we present a combined study of price competition and traffic control in a congested network. We study a model in which service providers own the routes in a network...
Asuman E. Ozdaglar
SODA
2010
ACM
163views Algorithms» more  SODA 2010»
14 years 2 months ago
Geometric optimization and sums of algebraic functions
We present a new optimization technique that yields the first FPTAS for several geometric problems. These problems reduce to optimizing a sum of non-negative, constant description...
Antoine Vigneron
RTAS
1999
IEEE
13 years 9 months ago
On Quality of Service Optimization with Discrete QoS Options
We present a QoS management framework that enables us to quantitatively measure QoS, and to analytically plan and allocate resources. In this model, end users' quality prefer...
Chen Lee, John P. Lehoczky, Ragunathan Rajkumar, D...
TIT
2010
115views Education» more  TIT 2010»
12 years 11 months ago
On resource allocation in fading multiple-access channels-an efficient approximate projection approach
We consider the problem of rate and power allocation in a multiple-access channel. Our objective is to obtain rate and power allocation policies that maximize a general concave ut...
Ali ParandehGheibi, Atilla Eryilmaz, Asuman E. Ozd...