2880 search results - page 108 / 576 » Approximate Range Searching |
140
click to vote
SIGIR
2005
ACM
15 years 9 months ago
2005
ACM
We formulate and study search algorithms that consider a user’s prior interactions with a wide variety of content to personalize that user’s current Web search. Rather than re...
129
click to vote
GECCO
2010
Springer
15 years 8 months ago
2010
Springer
In order to allow a comparison of (otherwise incomparable) sets, many evolutionary multiobjective optimizers use indicator functions to guide the search and to evaluate the perfor...
127
Voted
TCC
2007
Springer
15 years 9 months ago
2007
Springer
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
159
Voted
ATAL
2005
Springer
15 years 9 months ago
2005
Springer
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
138
click to vote
MICAI
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...