Sciweavers

5214 search results - page 353 / 1043
» The Online Specialization Problem
Sort
View
SIAMDM
2008
77views more  SIAMDM 2008»
15 years 6 months ago
The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
The Windy Postman Problem consists of finding a minimum cost traversal of all the edges of an undirected graph with two costs associated with each edge, representing the costs of ...
Angel Corberán, Isaac Plana, José M....
CORR
2010
Springer
157views Education» more  CORR 2010»
15 years 5 months ago
Stochastic Budget Optimization in Internet Advertising
Internet advertising is a sophisticated game in which the many advertisers "play" to optimize their return on investment. There are many "targets" for the adve...
Bhaskar DasGupta, S. Muthukrishnan
UAI
2008
15 years 8 months ago
Dyna-Style Planning with Linear Function Approximation and Prioritized Sweeping
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
Richard S. Sutton, Csaba Szepesvári, Alborz...
195
Voted
PC
2008
123views Management» more  PC 2008»
15 years 6 months ago
The impact of heterogeneity on master-slave scheduling
In this paper, we assess the impact of heterogeneity on scheduling independent tasks on master-slave platforms. We assume a realistic one-port model where the master can communica...
Jean-Francois Pineau, Yves Robert, Fréd&eac...
SODA
2012
ACM
173views Algorithms» more  SODA 2012»
13 years 9 months ago
Resource augmentation for weighted flow-time explained by dual fitting
We propose a general dual-fitting technique for analyzing online scheduling algorithms in the unrelated machines setting where the objective function involves weighted flow-time...
S. Anand 0002, Naveen Garg, Amit Kumar