7930 search results - page 1157 / 1586 » Greedy in Approximation Algorithms |
160
click to vote
ADHOCNOW
2003
Springer
16 years 1 days ago
2003
Springer
We consider topology control problems where the goal is to assign transmission powers to the nodes of an ad hoc network so as to induce graphs satisfying specific properties. The ...
155
click to vote
CSCLP
2003
Springer
16 years 1 days ago
2003
Springer
Abstract. In [8], Freuder defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently [2], we extended the definition of interchangeability to Soft ...
180
click to vote
EMO
2003
Springer
16 years 1 days ago
2003
Springer
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...
171
click to vote
ESA
2003
Springer
16 years 1 days ago
2003
Springer
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 ...
150
click to vote
GECCO
2003
Springer
16 years 21 hour ago
2003
Springer
While genetically inspired approaches to multi-objective optimization have many advantages over conventional approaches, they do not explicitly exploit directional/gradient informa...