Sciweavers

915 search results - page 8 / 183
» Maximally Abstract Retrenchments
Sort
View
ICC
2008
IEEE
122views Communications» more  ICC 2008»
14 years 2 months ago
Optimizing Adaptive Modulation in Wireless Networks via Utility Maximization
Abstract— We investigate adaptive modulation using the network utility maximization framework. We derive new crosslayer optimal power and rate adaptation policies for several pra...
Daniel O'Neill, Andrea J. Goldsmith, Stephen P. Bo...
INFOCOM
2006
IEEE
14 years 1 months ago
Alternative Decompositions for Distributed Maximization of Network Utility: Framework and Applications
Abstract— Network utility maximization (NUM) problems provide an important approach to conduct network resource management such as end-to-end rate allocation. In the existing lit...
Daniel Pérez Palomar, Mung Chiang
NIPS
2008
13 years 9 months ago
An Online Algorithm for Maximizing Submodular Functions
We present an algorithm for solving a broad class of online resource allocation . Our online algorithm can be applied in environments where abstract jobs arrive one at a time, and...
Matthew J. Streeter, Daniel Golovin
ALGOSENSORS
2007
Springer
14 years 2 months ago
Maximal Breach in Wireless Sensor Networks: Geometric Characterization and Algorithms
e for abstract modeling, algorithmic design and analysis to achieve provably efficient, scalable and fault-tolerant realizations of such huge, highly-dynamic, complex, non-conventi...
Anirvan DuttaGupta, Arijit Bishnu, Indranil Sengup...
ML
2007
ACM
106views Machine Learning» more  ML 2007»
13 years 7 months ago
Surrogate maximization/minimization algorithms and extensions
Abstract Surrogate maximization (or minimization) (SM) algorithms are a family of algorithms that can be regarded as a generalization of expectation-maximization (EM) algorithms. A...
Zhihua Zhang, James T. Kwok, Dit-Yan Yeung