Sciweavers

8724 search results - page 125 / 1745
» Search result diversification
Sort
View
TCS
2008
15 years 6 months ago
The cost of offline binary search tree algorithms and the complexity of the request sequence
In evaluating the performance of online algorithms for search trees, one wants to compare them to the best offline algorithm available. In this paper we lower bound the cost of an...
Jussi Kujala, Tapio Elomaa
HEURISTICS
2002
108views more  HEURISTICS 2002»
15 years 6 months ago
Cooperative Parallel Tabu Search for Capacitated Network Design
We present a cooperative parallel tabu search method for the fixed charge, capacitated, multicommodity network design problem. Several communication strategies are analyzed and co...
Teodor Gabriel Crainic, Michel Gendreau
CORR
2011
Springer
171views Education» more  CORR 2011»
14 years 10 months ago
Orthogonal Range Searching on the RAM, Revisited
We present a number of new results on one of the most extensively studied topics in computational geometry, orthogonal range searching. All our results are in the standard word RA...
Timothy M. Chan, Kasper Green Larsen, Mihai Patras...
ICTAI
2002
IEEE
15 years 11 months ago
Data Mining Using Cultural Algorithms and Regional Schemata
In the paper we demonstrate how evolutionary search for functional optima can be used as a vehicle for data mining. That is, in the process of searching for optima in a multi-dime...
Xidong Jin, Robert G. Reynolds
ERCIMDL
1999
Springer
104views Education» more  ERCIMDL 1999»
15 years 10 months ago
The Small World Web
I show that the World Wide Web is a small world, in the sense that sites are highly clustered yet the path length between them is small. I also demonstrate the advantages of a sear...
Lada A. Adamic