Sciweavers

403 search results - page 36 / 81
» Sampling Bounds for Stochastic Optimization
Sort
View
SODA
2012
ACM
177views Algorithms» more  SODA 2012»
12 years 9 days ago
Stochastic coalescence in logarithmic time
The following distributed coalescence protocol was introduced by Dahlia Malkhi in 2006 motivated by applications in social networking. Initially there are n agents wishing to coal...
Po-Shen Loh, Eyal Lubetzky
MP
2008
126views more  MP 2008»
13 years 9 months ago
Geometry of interpolation sets in derivative free optimization
We consider derivative free methods based on sampling approaches for nonlinear optimization problems where derivatives of the objective function are not available and cannot be dir...
Andrew R. Conn, Katya Scheinberg, Luís N. V...
PRDC
2000
IEEE
14 years 1 months ago
Statistical non-parametric algorithms to estimate the optimal software rejuvenation schedule
In this paper, we extend the classical result by Huang, Kintala, Kolettis and Fulton (1995), and in addition propose a modified stochastic model to determine the software rejuvena...
Tadashi Dohi, Katerina Goseva-Popstojanova, Kishor...
SIAMCO
2010
93views more  SIAMCO 2010»
13 years 8 months ago
Dynamic Vehicle Routing with Priority Classes of Stochastic Demands
In this paper we introduce a dynamic vehicle routing problem in which there are multiple vehicles and multiple priority classes of service demands. Service demands of each priority...
Stephen L. Smith, Marco Pavone, Francesco Bullo, E...
CORR
2010
Springer
112views Education» more  CORR 2010»
13 years 7 months ago
Optimal Distributed Online Prediction using Mini-Batches
Online prediction methods are typically presented as serial algorithms running on a single processor. However, in the age of web-scale prediction problems, it is increasingly comm...
Ofer Dekel, Ran Gilad-Bachrach, Ohad Shamir, Lin X...