Sciweavers

1137 search results - page 44 / 228
» The GLOBAL optimization method revisited
Sort
View
SIAMJO
2000
108views more  SIAMJO 2000»
14 years 10 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
ASPDAC
2004
ACM
117views Hardware» more  ASPDAC 2004»
15 years 4 months ago
Performance-driven global placement via adaptive network characterization
Delay minimization continues to be an important objective in the design of high-performance computing system. In this paper, we present an effective methodology to guide the delay...
Mongkol Ekpanyapong, Sung Kyu Lim
ENTCS
2008
115views more  ENTCS 2008»
14 years 10 months ago
Time Separation of Events: An Inverse Method
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, ...
Emmanuelle Encrenaz, Laurent Fribourg
GECCO
2005
Springer
101views Optimization» more  GECCO 2005»
15 years 4 months ago
Measuring mobility and the performance of global search algorithms
The global search properties of heuristic search algorithms are not well understood. In this paper, we introduce a new metric, mobility, that quantifies the dispersion of local o...
Monte Lunacek, L. Darrell Whitley, James N. Knight
ICCV
2011
IEEE
13 years 10 months ago
Tracking Multiple People under Global Appearance Constraints
In this paper, we show that tracking multiple people whose paths may intersect can be formulated as a convex global optimization problem. Our proposed framework is designed to exp...
Horesh Ben Shitrit, Jerome Berclaz, Francois Fleur...