403 search results - page 52 / 81 » Sampling Bounds for Stochastic Optimization |
GECCO
2006
Springer
14 years 1 months ago
2006
Springer
This paper presents a hybrid technique that combines List Scheduling (LS) with Genetic Algorithms (GA) for constructing non-preemptive schedules for soft real-time parallel applic...
COLT
2010
Springer
13 years 8 months ago
2010
Springer
We consider the problem of finding the best arm in a stochastic multi-armed bandit game. The regret of a forecaster is here defined by the gap between the mean reward of the optim...
JMLR
2012
12 years 9 days ago
2012
In this paper, we propose a second order optimization method to learn models where both the dimensionality of the parameter space and the number of training samples is high. In ou...
CORR
2006
Springer
2006
Springer
Dense Gaussian Sensor Networks: Minimum Achievable Distortion and the Order Optimality of Separation
13 years 10 months ago
We investigate the optimal performance of dense sensor networks by studying the joint source-channel coding problem. The overall goal of the sensor network is to take measurements...
GECCO
2003
Springer
14 years 3 months ago
2003
Springer
Reliable execution and analysis of an evolutionary algorithm (EA) normally requires many runs to provide reasonable assurance that stochastic effects have been properly considered...