Sciweavers

44 search results - page 7 / 9
» Sequential sampling for solving stochastic programs
Sort
View
CPAIOR
2008
Springer
13 years 9 months ago
Amsaa: A Multistep Anticipatory Algorithm for Online Stochastic Combinatorial Optimization
The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decis...
Luc Mercier, Pascal Van Hentenryck
SIGMETRICS
2010
ACM
206views Hardware» more  SIGMETRICS 2010»
14 years 7 days ago
Successive c-optimal designs: a scalable technique to optimize the measurements on large networks
We propose a new approach to optimize the deployment and the sampling rates of network monitoring tools, such as Netflow, on a large IP network. It reduces to solving a stochasti...
Guillaume Sagnol, Mustapha Bouhtou, Stephane Gaube...
GECCO
2010
Springer
194views Optimization» more  GECCO 2010»
13 years 11 months ago
Mirrored variants of the (1, 2)-CMA-ES compared on the noisy BBOB-2010 testbed
Derandomization by means of mirrored samples has been recently introduced to enhance the performances of (1, λ) and (1 + 2) Evolution-Strategies (ESs) with the aim of designing f...
Anne Auger, Dimo Brockhoff, Nikolaus Hansen
EUROGP
2008
Springer
13 years 9 months ago
PlasmidPL: A Plasmid-Inspired Language for Genetic Programming
We present PlasmidPL, a plasmid-inspired programming language designed for Genetic Programming (GP), and based on a chemical metaphor. The basic data structures in PlasmidPL are ci...
Lidia Yamamoto
CORR
2011
Springer
219views Education» more  CORR 2011»
13 years 2 months ago
Active Markov Information-Theoretic Path Planning for Robotic Environmental Sensing
Recent research in multi-robot exploration and mapping has focused on sampling environmental fields, which are typically modeled using the Gaussian process (GP). Existing informa...
Kian Hsiang Low, John M. Dolan, Pradeep K. Khosla