727 search results - page 25 / 146 » Private approximation of search problems |
AAAI
2000
14 years 9 days ago
2000
Many problem-solving tasks can be formalized as constraint satisfaction problems (CSPs). In a multi-agent setting, information about constraints and variables may belong to differ...
JUCS
2007
13 years 10 months ago
2007
: An approach to polygonal approximation of regular digital curves based on PSO algorithm is presented. In this paper, each particle corresponds to a candidate solution to the poly...
FOGA
2011
13 years 2 months ago
2011
The distribution of fitness values across a set of states sharply influences the dynamics of evolutionary processes and heuristic search in combinatorial optimization. In this p...
IPCO
2010
13 years 9 months ago
2010
We consider the facility location problem where each facility can serve at most U clients. We analyze a local search algorithm for this problem which uses only the operations of ad...
DEXAW
1999
IEEE
1999
IEEE
Using the Distance Distribution for Approximate Similarity Queries in High-Dimensional Metric Spaces
14 years 3 months ago
We investigate the problem of approximate similarity (nearest neighbor) search in high-dimensional metric spaces, and describe how the distance distribution of the query object ca...