1647 search results - page 235 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
149
click to vote
ICDCS
2006
IEEE
15 years 8 months ago
2006
IEEE
Distributed hash table (DHT) networks based on consistent hashing functions have an inherent load balancing problem. The problem becomes more severe due to the heterogeneity of ne...
111
click to vote
CIKM
2009
Springer
15 years 9 months ago
2009
Springer
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
IPL
2008
15 years 2 months ago
2008
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
JEA
2006
15 years 2 months ago
2006
In this paper we show cache-friendly implementations of the Floyd-Warshall algorithm for the All-Pairs ShortestPath problem. We first compare the best commercial compiler optimiza...
106
click to vote
PODS
1999
ACM
15 years 6 months ago
1999
ACM
Query optimizers rely on fast, high-quality estimates of result sizes in order to select between various join plans. Selfjoin sizes of relations provide bounds on the join size of...