Sciweavers

577 search results - page 39 / 116
» New interval methods for constrained global optimization
Sort
View
WSC
2007
15 years 6 months ago
Extension of the direct optimization algorithm for noisy functions
DIRECT (DIviding RECTangles) is a deterministic global optimization algorithm for bound-constrained problems. The algorithm, based on a space-partitioning scheme, performs both gl...
Geng Deng, Michael C. Ferris
ICCAD
1999
IEEE
113views Hardware» more  ICCAD 1999»
15 years 8 months ago
Attractor-repeller approach for global placement
Traditionally, analytic placement used linear or quadratic wirelength objective functions. Minimizing either formulation attracts cells sharing common signals (nets) together. The...
Hussein Etawil, Shawki Areibi, Anthony Vannelli
MOC
2000
76views more  MOC 2000»
15 years 3 months ago
Optimal approximation of stochastic differential equations by adaptive step-size control
We study the pathwise (strong) approximation of scalar stochastic differential equations with respect to the global error in the L2-norm. For equations with additive noise we estab...
Norbert Hofmann, Thomas Müller-Gronbach, Klau...
GECCO
2005
Springer
101views Optimization» more  GECCO 2005»
15 years 9 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
ACL
2006
15 years 5 months ago
A Discriminative Global Training Algorithm for Statistical MT
This paper presents a novel training algorithm for a linearly-scored block sequence translation model. The key component is a new procedure to directly optimize the global scoring...
Christoph Tillmann, Tong Zhang