1137 search results - page 9 / 228 » The GLOBAL optimization method revisited |
ICIP
2007
IEEE
14 years 9 months ago
2007
IEEE
Current multimodal registration methods almost always rely on local gradient-descent type optimization strategies. Such registration methods often converge to an incorrect local o...
EVOW
2009
Springer
14 years 2 months ago
2009
Springer
Dynamic time-linkage problems (DTPs) are common types of dynamic optimization problems where "decisions that are made now ... may in‡uence the maximum score that can be obta...
DAGSTUHL
2004
13 years 9 months ago
2004
We consider the global optimization problem for d-variate Lipschitz functions which, in a certain sense, do not increase too slowly in a neighborhood of the global minimizer(s). O...
AMC
2005
13 years 7 months ago
2005
We present an interval branch-and-prune algorithm for computing verified enclosures for the global minimum and all global minimizers of univariate functions subject to bound const...
ISQED
2009
IEEE
14 years 2 months ago
2009
IEEE
— This paper revisits and extends a general linear programming(LP) formulation to exploit multiple knobs such as multi-Lgate footprint-compatible libraries and post-layout Lgateb...