Sciweavers

1093 search results - page 207 / 219
» Crossover in Probability Spaces
Sort
View
SIGGRAPH
1997
ACM
14 years 2 months ago
Metropolis light transport
We present a new Monte Carlo method for solving the light transport problem, inspired by the Metropolis sampling method in computational physics. To render an image, we generate a...
Eric Veach, Leonidas J. Guibas
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
14 years 2 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh
GECCO
2010
Springer
194views Optimization» more  GECCO 2010»
14 years 1 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
CIKM
2006
Springer
14 years 1 months ago
Finding highly correlated pairs efficiently with powerful pruning
We consider the problem of finding highly correlated pairs in a large data set. That is, given a threshold not too small, we wish to report all the pairs of items (or binary attri...
Jian Zhang, Joan Feigenbaum
EVOW
2006
Springer
14 years 1 months ago
A Preliminary Study on Handling Uncertainty in Indicator-Based Multiobjective Optimization
Abstract. Real-world optimization problems are often subject to uncertainties, which can arise regarding stochastic model parameters, objective functions and decision variables. Th...
Matthieu Basseur, Eckart Zitzler