Sciweavers

810 search results - page 25 / 162
» Defining implicit objective functions for design problems
Sort
View
ICPR
2004
IEEE
14 years 10 months ago
A Unified Information-Theoretic Approach to the Correspondence Problem in Image Registration
We consider the correspondence problem associated with the non-rigid registration of a group of images; in particular, the theoretical basis for the derivation of the objective fu...
Carole J. Twining, Stephen Marsland, Christopher J...
GECCO
2006
Springer
179views Optimization» more  GECCO 2006»
14 years 17 days ago
Local search for multiobjective function optimization: pareto descent method
Genetic Algorithm (GA) is known as a potent multiobjective optimization method, and the effectiveness of hybridizing it with local search (LS) has recently been reported in the li...
Ken Harada, Jun Sakuma, Shigenobu Kobayashi
VISUALIZATION
1998
IEEE
14 years 1 months ago
Visualization for multiparameter aircraft designs
We describe an aircraft design problem in high dimensional space, with D typically being 10 to 30. In some respects this is a classic optimization problem, where the goal is to fi...
Clifford A. Shaffer, Duane L. Knill, Layne T. Wats...
TKDE
2002
141views more  TKDE 2002»
13 years 8 months ago
Algorithms for Finding Attribute Value Group for Binary Segmentation of Categorical Databases
We consider the problem of finding a set of attribute values that give a high quality binary segmentation of a database. The quality of a segmentation is defined by an objective fu...
Yasuhiko Morimoto, Takeshi Fukuda, Takeshi Tokuyam...
COR
2010
150views more  COR 2010»
13 years 9 months ago
Black box scatter search for general classes of binary optimization problems
The purpose of this paper is to apply the scatter search methodology to general classes of binary problems. We focus on optimization problems for which the solutions are represent...
Francisco Gortázar, Abraham Duarte, Manuel ...