Sciweavers

403 search results - page 30 / 81
» Sampling Bounds for Stochastic Optimization
Sort
View
CORR
2007
Springer
82views Education» more  CORR 2007»
13 years 9 months ago
Sorting and Selection with Random Costs
There is a growing body of work on sorting and selection in models other than the unit-cost comparison model. This work treats a natural stochastic variant of the problem where the...
Stanislav Angelov, Keshav Kunal, Andrew McGregor
ROBOCOMM
2007
IEEE
14 years 4 months ago
Decentralized vehicle routing in a stochastic and dynamic environment with customer impatience
— Consider the following scenario: a spatio-temporal stochastic process generates service requests, localized at points in a bounded region on the plane; these service requests a...
Marco Pavone, Nabhendra Bisnik, Emilio Frazzoli, V...
FUIN
2006
95views more  FUIN 2006»
13 years 10 months ago
Bounds for Validation
In this paper we derive the bounds for Validation (known also as Hold-Out Estimate and Train-and-Test Method). We present the best possible bound in the case of 0-1 valued loss fun...
Wojciech Jaworski
SAGA
2009
Springer
14 years 4 months ago
Economical Caching with Stochastic Prices
In the economical caching problem, an online algorithm is given a sequence of prices for a certain commodity. The algorithm has to manage a buffer of fixed capacity over time. We...
Matthias Englert, Berthold Vöcking, Melanie W...
ADCM
2010
59views more  ADCM 2010»
13 years 10 months ago
Sampling inequalities for infinitely smooth functions, with applications to interpolation and machine learning
Sampling inequalities give a precise formulation of the fact that a differentiable function cannot attain large values, if its derivatives are bounded and if it is small on a suff...
Christian Rieger, Barbara Zwicknagl