16082 search results - page 8 / 3217 » Fireworks Algorithm for Optimization |
DAGSTUHL
2004
13 years 8 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...
CC
2006
Springer
13 years 11 months ago
2006
Springer
We introduce a new class of compiler heuristics: hybrid optimizations. Hybrid optimizations choose dynamically at compile time which optimization algorithm to apply from a set of d...
ICTAI
1997
IEEE
13 years 11 months ago
1997
IEEE
Many black box optimization algorithms have sufcient exibility to allow them to adapt to the varying circumstances they encounter. These capabilities are of two primary sorts: 1) ...
EACL
2009
ACL Anthology
13 years 5 months ago
2009
ACL Anthology
We show how global constraints such as transitivity can be treated intensionally in a Zero-One Integer Linear Programming (ILP) framework which is geared to find the optimal and c...
SIAMJO
2010
13 years 2 months ago
2010
Necessary first-order sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. These conditions are sati...