Sciweavers

43 search results - page 4 / 9
» Pareto optimal search based refactoring at the design level
Sort
View
VLDB
2002
ACM
151views Database» more  VLDB 2002»
13 years 5 months ago
Preference SQL - Design, Implementation, Experiences
Current search engines can hardly cope adequately with fuzzy predicates defined by complex preferences. The biggest problem of search engines implemented with standard SQL is that...
Werner Kießling, Gerhard Köstler
GECCO
2004
Springer
145views Optimization» more  GECCO 2004»
13 years 11 months ago
Search Based Automatic Test-Data Generation at an Architectural Level
Abstract. The need for effective testing techniques for architectural level descriptions is widely recognised. However, due to the variety of domain-specific architectural descript...
Yuan Zhan, John A. Clark
GECCO
2008
Springer
239views Optimization» more  GECCO 2008»
13 years 7 months ago
Multiobjective design of operators that detect points of interest in images
In this paper, a multiobjective (MO) learning approach to image feature extraction is described, where Pareto-optimal interest point (IP) detectors are synthesized using genetic p...
Leonardo Trujillo, Gustavo Olague, Evelyne Lutton,...
PPSN
2004
Springer
13 years 11 months ago
Indicator-Based Selection in Multiobjective Search
Abstract. This paper discusses how preference information of the decision maker can in general be integrated into multiobjective search. The main idea is to first define the opti...
Eckart Zitzler, Simon Künzli
EMO
2003
Springer
86views Optimization» more  EMO 2003»
13 years 11 months ago
No Free Lunch and Free Leftovers Theorems for Multiobjective Optimisation Problems
Abstract. The classic NFL theorems are invariably cast in terms of single objective optimization problems. We confirm that the classic NFL theorem holds for general multiobjective ...
David Corne, Joshua D. Knowles