Sciweavers

574 search results - page 64 / 115
» Approximation Algorithms for Free-Label Maximization
Sort
View
AAMAS
2011
Springer
13 years 3 months ago
Long-term fairness with bounded worst-case losses
How does one repeatedly choose actions so as to be fairest to the multiple beneficiaries of those actions? We examine approaches to discovering sequences of actions for which the...
Gabriel Catalin Balan, Dana Richards, Sean Luke
CDC
2010
IEEE
124views Control Systems» more  CDC 2010»
13 years 3 months ago
Deployment of drifters in a piecewise-constant flow environment
We study a deployment strategy for a group of vehicles that drift in an ambient flow field. Specifically, we address the case where the flow is always greater in magnitude than an ...
Andrew Kwok, Sonia Martínez
TOC
2010
127views Management» more  TOC 2010»
13 years 3 months ago
The Submodular Welfare Problem with Demand Queries
: We consider the Submodular Welfare Problem where we have m items and n players with given utility functions wi : 2[m] R+. The utility functions are assumed to be monotone and su...
Uriel Feige, Jan Vondrák
ICASSP
2011
IEEE
13 years 13 days ago
Dynamic spectrum management in DSL with asynchronous crosstalk
Dynamic spectrum management (DSM) aims to optimally allocate per-user transmit spectra so that the effect of multiuser interference (crosstalk) is minimized and the capabilities o...
Rodrigo B. Moraes, Paschalis Tsiaflakis, Marc Moon...
ICALP
2003
Springer
14 years 1 months ago
Algorithmic Aspects of Bandwidth Trading
We study algorithmic problems that are motivated by bandwidth trading in next generation networks. Typically, bandwidth trading involves sellers (e.g., network operators) interest...
Randeep Bhatia, Julia Chuzhoy, Ari Freund, Joseph ...