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...
We present a cooperative parallel tabu search method for the fixed charge, capacitated, multicommodity network design problem. Several communication strategies are analyzed and co...
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...
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...
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...