Sciweavers

255 search results - page 11 / 51
» Generalized Boosting Algorithms for Convex Optimization
Sort
View
EOR
2006
103views more  EOR 2006»
13 years 8 months ago
Exact solutions to a class of stochastic generalized assignment problems
This paper deals with a stochastic Generalized Assignment Problem with recourse. Only a random subset of the given set of jobs will require to be actually processed. An assignment...
Maria Albareda-Sambola, Maarten H. van der Vlerk, ...
MFCS
2004
Springer
14 years 2 months ago
Optimal Preemptive Scheduling for General Target Functions
We study the problem of optimal preemptive scheduling with respect to a general target function. Given n jobs with associated weights and m ≤ n uniformly related machines, one a...
Leah Epstein, Tamir Tassa
CORR
2011
Springer
261views Education» more  CORR 2011»
13 years 3 months ago
Convex and Network Flow Optimization for Structured Sparsity
We consider a class of learning problems regularized by a structured sparsity-inducing norm defined as the sum of 2- or ∞-norms over groups of variables. Whereas much effort ha...
Julien Mairal, Rodolphe Jenatton, Guillaume Obozin...
VEE
2012
ACM
187views Virtualization» more  VEE 2012»
12 years 4 months ago
DDGacc: boosting dynamic DDG-based binary optimizations through specialized hardware support
Dynamic Binary Translators (DBT) and Dynamic Binary Optimization (DBO) by software are used widely for several reasons including performance, design simplification and virtualiza...
Demos Pavlou, Enric Gibert, Fernando Latorre, Anto...
SWAT
2010
Springer
279views Algorithms» more  SWAT 2010»
14 years 1 months ago
Online Function Tracking with Generalized Penalties
We attend to the classic setting where an observer needs to inform a tracker about an arbitrary time varying function f : N0 → Z. This is an optimization problem, where both wron...
Marcin Bienkowski, Stefan Schmid