Sciweavers

2126 search results - page 20 / 426
» An optimization algorithm for imprecise multi-objective prob...
Sort
View
ICTAC
2005
Springer
15 years 3 months ago
Maximum Marking Problems with Accumulative Weight Functions
We present a new derivation of efficient algorithms for a class of optimization problems called maximum marking problems. We extend the class of weight functions used in the speciļ...
Isao Sasano, Mizuhito Ogawa, Zhenjiang Hu
ECCV
2000
Springer
15 years 11 months ago
Diffeomorphic Matching Problems in One Dimension: Designing and Minimizing Matching Functionals
This paper focuses on matching 1D structures by variational methods. We provide rigorous rules for the construction of the cost function, on the basis of an analysis of properties ...
Alain Trouvé, Laurent Younes
GECCO
2000
Springer
108views Optimization» more  GECCO 2000»
15 years 1 months ago
Hierarchical Problem Solving and the Bayesian Optimization Algorithm
The paper discusses three major issues. First, it discusses why it makes sense to approach problems in a hierarchical fashion. It de nes the class of hierarchically decomposable f...
Martin Pelikan, David E. Goldberg
AUSAI
2009
Springer
15 years 1 months ago
Classification-Assisted Memetic Algorithms for Equality-Constrained Optimization Problems
Regressions has successfully been incorporated into memetic algorithm (MA) to build surrogate models for the objective or constraint landscape of optimization problems. This helps ...
Stephanus Daniel Handoko, Chee Keong Kwoh, Yew-Soo...
WSC
2007
15 years 4 days 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