Sciweavers

902 search results - page 30 / 181
» R* Search
Sort
View
GECCO
2006
Springer
151views Optimization» more  GECCO 2006»
14 years 2 months ago
Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
Martin Gruber, Jano I. van Hemert, Günther R....
SISAP
2008
IEEE
115views Data Mining» more  SISAP 2008»
14 years 5 months ago
A Dynamic Pivot Selection Technique for Similarity Search
All pivot-based algorithms for similarity search use a set of reference points called pivots. The pivot-based search algorithm precomputes some distances to these reference points...
Benjamin Bustos, Oscar Pedreira, Nieves R. Brisabo...
IJCAI
1989
14 years 10 hour ago
The Reason for the Benefits of Minimax Search
based on an abstract concept of quiescence. In the following we sketch this and a related model, describe the design of our experiments, and present the results of our simulation s...
Anton Scheucher, Hermann Kaindl
CHI
2008
ACM
14 years 11 months ago
Pick me!: link selection in expertise search results
Expertise locator systems have been designed to help find experts within organizations. While there are many examples of these systems in the literature, there has not been any sy...
N. Sadat Shami, Kate Ehrlich, David R. Millen
INFOCOM
2002
IEEE
14 years 3 months ago
Locality in Search Engine Queries and Its Implications for Caching
—Caching is a popular technique for reducing both server load and user response time in distributed systems. In this paper, we consider the question of whether caching might be e...
Yinglian Xie, David R. O'Hallaron