Sciweavers

28 search results - page 4 / 6
» wea 2005
Sort
View
WEA
2005
Springer
91views Algorithms» more  WEA 2005»
15 years 10 months ago
The Necessity of Timekeeping in Adversarial Queueing
We study queueing strategies in the adversarial queueing model. Rather than discussing individual prominent queueing strategies we tackle the issue on a general level and analyze c...
Maik Weinard
WEA
2005
Springer
154views Algorithms» more  WEA 2005»
15 years 10 months ago
Experimental Evaluation of the Greedy and Random Algorithms for Finding Independent Sets in Random Graphs
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...
Mark K. Goldberg, D. Hollinger, Malik Magdon-Ismai...
WEA
2005
Springer
89views Algorithms» more  WEA 2005»
15 years 10 months ago
Implementation of Approximation Algorithms for the Multicast Congestion Problem
Abstract. We implement the approximation algorithm for the multicast congestion problem in communication networks in [14] based on the fast approximation algorithm for packing prob...
Qiang Lu, Hu Zhang
WEA
2005
Springer
89views Algorithms» more  WEA 2005»
15 years 10 months ago
Don't Compare Averages
We point out that for two sets of measurements, the sign of the difference of their averages is not necessarily maintained by a non-linear monotone transformation of the individu...
Holger Bast, Ingmar Weber
WEA
2005
Springer
105views Algorithms» more  WEA 2005»
15 years 10 months ago
Inferring AS Relationships: Dead End or Lively Beginning?
Recent techniques for inferring business relationships between ASs [3, 8] have yielded maps that have extremely few invalid BGP paths in the terminology of Gao [9]. However, some ...
Xenofontas A. Dimitropoulos, Dmitri V. Krioukov, B...