Sciweavers

7150 search results - page 968 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
155
Voted
CSCLP
2003
Springer
16 years 3 days ago
Experimental Evaluation of Interchangeability in Soft CSPs
Abstract. In [8], Freuder defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently [2], we extended the definition of interchangeability to Soft ...
Nicoleta Neagu, Stefano Bistarelli, Boi Faltings
182
Voted
EMO
2003
Springer
137views Optimization» more  EMO 2003»
16 years 2 days ago
A Two-Phase Local Search for the Biobjective Traveling Salesman Problem
This article proposes the Two-Phase Local Search for finding a good approximate set of non-dominated solutions. The two phases of this procedure are to (i) generate an initial sol...
Luis Paquete, Thomas Stützle
172
Voted
ESA
2003
Springer
90views Algorithms» more  ESA 2003»
16 years 2 days ago
Packing a Trunk
We report on a project with a German car manufacturer. The task is to compute (approximate) solutions to a specific large-scale packing problem. Given a polyhedral model of a car ...
Friedrich Eisenbrand, Stefan Funke, Joachim Reiche...
GECCO
2003
Springer
16 years 2 days ago
Effective Use of Directional Information in Multi-objective Evolutionary Computation
While genetically inspired approaches to multi-objective optimization have many advantages over conventional approaches, they do not explicitly exploit directional/gradient informa...
Martin Brown, Robert E. Smith
191
Voted
ICCBR
2003
Springer
16 years 2 days ago
Using Evolution Programs to Learn Local Similarity Measures
Abstract. The definition of similarity measures is one of the most crucial aspects when developing case-based applications. In particular, when employing similarity measures that ...
Armin Stahl, Thomas Gabel