71228 search results - page 244 / 14246 » Algorithms |
120
click to vote
INFOCOM
2000
IEEE
15 years 6 months ago
2000
IEEE
Abstract—We investigate the performance of TCP under three representatives of packet scheduling algorithms at the router. Our main focus is to investigate how fair service can be...
99
Voted
CIAC
2000
Springer
15 years 6 months ago
2000
Springer
We consideralgorithms for a simple one-dimensionalpoint placement problem: given N points on a line, and noisy measurements of the distances between many pairs of them, estimate th...
129
click to vote
PPOPP
1999
ACM
15 years 6 months ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
114
Voted
ISPAN
1999
IEEE
15 years 6 months ago
1999
IEEE
We present efficient all-to-all personalized communication algorithms for a 2D torus in wormhole-routed networks. Our complete exchange algorithm adopts divide-and-conquer approac...
CPE
1998
Springer
15 years 6 months ago
1998
Springer
Abstract. Approximate Mean Value Analysis (MVA) is a popular technique for analyzing queueing networks because of the efficiency and accuracy that it affords. In this paper, we pre...