Sciweavers

233 search results - page 13 / 47
» On Benchmarking Stochastic Global Optimization Algorithms
Sort
View
CDC
2008
IEEE
137views Control Systems» more  CDC 2008»
14 years 2 months ago
An approximate dynamic programming approach to probabilistic reachability for stochastic hybrid systems
— This paper addresses the computational overhead involved in probabilistic reachability computations for a general class of controlled stochastic hybrid systems. An approximate ...
Alessandro Abate, Maria Prandini, John Lygeros, Sh...
WSCG
2004
142views more  WSCG 2004»
13 years 9 months ago
Metropolis Iteration for Global Illumination
This paper presents a stochastic iteration algorithm solving the global illumination problem, where the random sampling is governed by classical importance sampling and also by th...
László Szirmay-Kalos, Bálazs ...
SIAMIS
2010
141views more  SIAMIS 2010»
13 years 2 months ago
Optimization by Stochastic Continuation
Simulated annealing (SA) and deterministic continuation are well-known generic approaches to global optimization. Deterministic continuation is computationally attractive but produ...
Marc C. Robini, Isabelle E. Magnin
AE
2005
Springer
14 years 1 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
CVPR
2008
IEEE
14 years 9 months ago
Object tracking and detection after occlusion via numerical hybrid local and global mode-seeking
Given an object model and a black-box measure of similarity between the model and candidate targets, we consider visual object tracking as a numerical optimization problem. During...
Zhaozheng Yin, Robert T. Collins