Sciweavers

894 search results - page 81 / 179
» Entropy-based Adaptive Sampling
Sort
View
CAV
2009
Springer
187views Hardware» more  CAV 2009»
14 years 9 months ago
A Markov Chain Monte Carlo Sampler for Mixed Boolean/Integer Constraints
We describe a Markov chain Monte Carlo (MCMC)-based algorithm for sampling solutions to mixed Boolean/integer constraint problems. The focus of this work differs in two points from...
Nathan Kitchen, Andreas Kuehlmann
AE
2005
Springer
14 years 2 months ago
Algorithms (X, sigma, eta): Quasi-random Mutations for Evolution Strategies
Randomization is an efficient tool for global optimization. We here define a method which keeps : – the order 0 of evolutionary algorithms (no gradient) ; – the stochastic as...
Anne Auger, Mohamed Jebalia, Olivier Teytaud
ISRR
2005
Springer
99views Robotics» more  ISRR 2005»
14 years 2 months ago
On the Probabilistic Foundations of Probabilistic Roadmap Planning
Why is probabilistic roadmap (PRM) planning probabilistic? How does the probability measure used for sampling a robot’s configuration space affect the performance of a PRM plan...
David Hsu, Jean-Claude Latombe, Hanna Kurniawati
GECCO
2003
Springer
14 years 2 months ago
Methods for Evolving Robust Programs
Many evolutionary computation search spaces require fitness assessment through the sampling of and generalization over a large set of possible cases as input. Such spaces seem par...
Liviu Panait, Sean Luke
SGP
2007
13 years 11 months ago
Robust statistical estimation of curvature on discretized surfaces
A robust statistics approach to curvature estimation on discretely sampled surfaces, namely polygon meshes and point clouds, is presented. The method exhibits accuracy, stability ...
Evangelos Kalogerakis, Patricio D. Simari, Derek N...