Sciweavers

1329 search results - page 70 / 266
» Randomly Sampling Molecules
Sort
View
GECCO
2009
Springer
115views Optimization» more  GECCO 2009»
14 years 2 months ago
Benchmarking the pure random search on the BBOB-2009 testbed
We benchmark the pure random search algorithm on the BBOB 2009 noise-free testbed. Each candidate solution is sampled uniformly in [−5, 5]D , where D denotes the search space di...
Anne Auger, Raymond Ros
GECCO
2009
Springer
118views Optimization» more  GECCO 2009»
14 years 2 months ago
Benchmarking the pure random search on the BBOB-2009 noisy testbed
We benchmark the Pure-Random-Search algorithm on the BBOB 2009 noisy testbed. Each candidate solution is sampled uniformly in [−5, 5]D , where D denotes the search space dimensi...
Anne Auger, Raymond Ros
IPPS
1997
IEEE
14 years 2 months ago
A Randomized Sorting Algorithm on the BSP model
We present a new randomized sorting algorithm on the Bulk-SynchronousParallel (BSP) model. The algorithm improves upon the parallel slack of previous algorithms to achieve optimal...
Alexandros V. Gerbessiotis, Constantinos J. Siniol...
CSDA
2007
100views more  CSDA 2007»
13 years 10 months ago
Convergence of random k-nearest-neighbour imputation
Random k-nearest-neighbour (RKNN) imputation is an established algorithm for filling in missing values in data sets. Assume that data are missing in a random way, so that missing...
Fredrik A. Dahl
MOC
1998
83views more  MOC 1998»
13 years 9 months ago
A sweep-plane algorithm for generating random tuples in simple polytopes
Abstract. A sweep-plane algorithm of Lawrence for convex polytope computation is adapted to generate random tuples on simple polytopes. In our method an affine hyperplane is swept ...
Josef Leydold, Wolfgang Hörmann