1689 search results - page 73 / 338 » Proximate point searching |
115
Voted
SODA
2000
ACM
15 years 2 months ago
2000
ACM
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
96
Voted
KDD
2009
ACM
16 years 1 months ago
2009
ACM
Most of recommender systems try to find items that are most relevant to the older choices of a given user. Here we focus on the "surprise me" query: A user may be bored ...
COLT
1993
Springer
15 years 4 months ago
1993
Springer
We introducea new learningproblem: learninga graph by piecemeal search, in which the learner must return every so often to its starting point (for refueling, say). We present two l...
100
Voted
ANTSW
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Ant colony optimization (ACO) is a metaheuristic that produces good results for a wide range of combinatorial optimization problems. Often such successful applications us...
99
Voted
EOR
2008
15 years 23 days ago
2008
We suggest a new heuristic for solving unconstrained continuous optimization problems. It is based on a generalized version of the variable neighborhood search metaheuristic. Diff...