269 search results - page 25 / 54 » A branch and bound method for stochastic global optimization |
ICC
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract ⎯ Currently, the most advanced framework for stochastic network calculus is the min-plus algebra, providing bounds for the end-to-end delay in networks. The bounds calcu...
67
Voted
ENTCS
2008
14 years 9 months ago
2008
The problem of "time separation" can be stated as follows: Given a system made of several connected components, each one entailing a local delay known with uncertainty, ...
SIAMJO
2008
14 years 9 months ago
2008
For a mathematical program with complementarity constraints (MPCC), we propose an active-set Newton method, which has the property of local quadratic convergence under the MPCC lin...
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...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
Recently, a convergence proof of stochastic search algorithms toward finite size Pareto set approximations of continuous multi-objective optimization problems has been given. The...