727 search results - page 29 / 146 » Private approximation of search problems |
GECCO
2008
Springer
14 years 23 hour ago
2008
Springer
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
CPM
2005
Springer
14 years 4 months ago
2005
Springer
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...
AAAI
1997
14 years 9 days ago
1997
The problem of counting the number of solutions to a constraint satisfaction problem (CSP) is rephrased in terms of probability updating in Bayes networks. Approximating the proba...
ICASSP
2010
IEEE
13 years 11 months ago
2010
IEEE
Handling large amounts of data, such as large image databases, requires the use of approximate nearest neighbor search techniques. Recently, Hamming embedding methods such as spec...
IPM
2002
13 years 10 months ago
2002
Although a substantial number of research projects have addressed music information retrieval over the past three decades, the field is still very immature. Few of these projects ...