Sciweavers

614 search results - page 23 / 123
» Globally Convergent Autocalibration
Sort
View
CGF
1999
79views more  CGF 1999»
14 years 11 months ago
Stochastic Iteration for Non-diffuse Global Illumination
This paper presents a single-pass, view-dependent method to solve the rendering equation, using a stochastic iterational scheme where the transport operator is selected randomly i...
László Szirmay-Kalos
ICTAI
2010
IEEE
14 years 9 months ago
Metropolis Particle Swarm Optimization Algorithm with Mutation Operator for Global Optimization Problems
When a local optimal solution is reached with classical Particle Swarm Optimization (PSO), all particles in the swarm gather around it, and escaping from this local optima becomes...
Lhassane Idoumghar, M. Idrissi-Aouad, Mahmoud Melk...
AE
2005
Springer
15 years 5 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
111
Voted
FOCI
2007
IEEE
15 years 3 months ago
Evolutionary Algorithms in the Presence of Noise: To Sample or Not to Sample
Abstract-- In this paper, we empirically analyze the convergence behavior of evolutionary algorithms (evolution strategies
Hans-Georg Beyer, Bernhard Sendhoff
SIAMJO
2000
108views more  SIAMJO 2000»
14 years 11 months ago
Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
Mathematical programs with nonlinear complementarity constraints are reformulated using better-posed but nonsmooth constraints. We introduce a class of functions, parameterized by...
Houyuan Jiang, Daniel Ralph