233 search results - page 13 / 47 » On Benchmarking Stochastic Global Optimization Algorithms |
88
Voted
CDC
2008
IEEE
15 years 4 months ago
2008
IEEE
— This paper addresses the computational overhead involved in probabilistic reachability computations for a general class of controlled stochastic hybrid systems. An approximate ...
WSCG
2004
14 years 11 months ago
2004
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...
105
click to vote
SIAMIS
2010
14 years 4 months ago
2010
Simulated annealing (SA) and deterministic continuation are well-known generic approaches to global optimization. Deterministic continuation is computationally attractive but produ...
AE
2005
Springer
15 years 3 months ago
2005
Springer
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...
117
click to vote
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
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...