1046 search results - page 93 / 210 » Approximation Algorithms for Domination Search |
112
click to vote
GECCO
2010
Springer
15 years 3 months ago
2010
Springer
Most surrogate approaches to multi-objective optimization build a surrogate model for each objective. These surrogates can be used inside a classical Evolutionary Multiobjective O...
106
Voted
EMO
2003
Springer
15 years 5 months 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...
109
Voted
SPIRE
1998
Springer
15 years 4 months ago
1998
Springer
We present a fast compression and decompression technique for natural language texts. The novelty is that the exact search can be done on the compressed text directly, using any k...
224
Voted
ICASSP
2011
IEEE
14 years 9 months ago
2011
IEEE
Recent indexing techniques inspired by source coding have been shown successful to index billions of high-dimensional vectors in memory. In this paper, we propose an approach that ...
97
Voted
FOCS
2007
IEEE
15 years 7 months ago
2007
IEEE
We continue the recent line of work on the connection between semidefinite programming-based approximation algorithms and the Unique Games Conjecture. Given any boolean 2-CSP (or...