Sciweavers

1185 search results - page 25 / 237
» The Equivalence of Sampling and Searching
Sort
View
NLP
2000
15 years 8 months ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman
APBC
2004
154views Bioinformatics» more  APBC 2004»
15 years 5 months ago
Dispensation Order Generation for Pyrosequencing
This article describes a dispensation order generation algorithm for genotyping using the Pyrosequencing method. The input template of the algorithm is a slightly restricted regul...
Mats Carlsson, Nicolas Beldiceanu
JAMDS
2000
90views more  JAMDS 2000»
15 years 4 months ago
Stratified filtered sampling in stochastic optimization
We develop a methodology for evaluating a decision strategy generated by a stochastic optimization model. The methodology is based on a pilot study in which we estimate the distri...
Robert Rush, John M. Mulvey, John E. Mitchell, Tho...
CGF
2008
227views more  CGF 2008»
15 years 4 months ago
Dynamic Sampling and Rendering of Algebraic Point Set Surfaces
Algebraic Point Set Surfaces (APSS) define a smooth surface from a set of points using local moving least-squares (MLS) fitting of algebraic spheres. In this paper we first revisi...
Gaël Guennebaud, Marcel Germann, Markus H. Gr...
GECCO
2010
Springer
237views Optimization» more  GECCO 2010»
15 years 9 months ago
Benchmarking the (1, 4)-CMA-ES with mirrored sampling and sequential selection on the noiseless BBOB-2010 testbed
The well-known Covariance Matrix Adaptation Evolution Strategy (CMA-ES) is a robust stochastic search algorithm for optimizing functions defined on a continuous search space RD ....
Anne Auger, Dimo Brockhoff, Nikolaus Hansen