Sciweavers

835 search results - page 51 / 167
» Adaptive Bound Optimization for Online Convex Optimization
Sort
View
CPAIOR
2010
Springer
14 years 2 months ago
An In-Out Approach to Disjunctive Optimization
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). T...
Matteo Fischetti, Domenico Salvagnin
INFOCOM
2010
IEEE
13 years 8 months ago
Scheduling Heterogeneous Real-Time Traffic over Fading Wireless Channels
We develop a general approach for designing scheduling policies for real-time traffic over wireless channels. We extend prior work, which characterizes a real-time flow by its traf...
I-Hong Hou, P. R. Kumar
ESA
2004
Springer
151views Algorithms» more  ESA 2004»
14 years 2 months ago
On Variable-Sized Multidimensional Packing
The main contribution of this paper is an optimal bounded space online algorithm for variable-sized multidimensional packing. In this problem, hyperboxes must be packed in ddimens...
Leah Epstein, Rob van Stee
ICDE
2009
IEEE
198views Database» more  ICDE 2009»
15 years 14 days ago
Double Index NEsted-Loop Reactive Join for Result Rate Optimization
Adaptive join algorithms have recently attracted a lot of attention in emerging applications where data is provided by autonomous data sources through heterogeneous network enviro...
Mihaela A. Bornea, Vasilis Vassalos, Yannis Kotidi...
IPPS
2003
IEEE
14 years 4 months ago
Continuous Compilation: A New Approach to Aggressive and Adaptive Code Transformation
Over the past several decades, the compiler research community has developed a number of sophisticated and powerful algorithms for a varierty of code improvements. While there are...
Bruce R. Childers, Jack W. Davidson, Mary Lou Soff...