144 search results - page 5 / 29 » Stochastic analyses for online combinatorial optimization pr... |
153
Voted
ANOR
2010
15 years 4 months ago
2010
This paper considers online stochastic optimization problems where uncertainties are characterized by a distribution that can be sampled and where time constraints severely limit t...
161
Voted
ASIAN
2004
Springer
15 years 11 months ago
2004
Springer
This paper considers online stochastic optimization problems where uncertainties are characterized by a distribution that can be sampled and where time constraints severely limit t...
138
click to vote
CEC
2007
IEEE
16 years 5 days ago
2007
IEEE
Abstract—Hybrid methods are very popular for solving problems from combinatorial optimization. In contrast to this the theoretical understanding of the interplay of different opt...
155
Voted
ATAL
2007
Springer
16 years 1 hour ago
2007
Springer
Optimal resource scheduling in multiagent systems is a computationally challenging task, particularly when the values of resources are not additive. We consider the combinatorial ...
172
Voted
JMLR
2010
15 years 18 days ago
2010
We consider regularized stochastic learning and online optimization problems, where the objective function is the sum of two convex terms: one is the loss function of the learning...