Sciweavers

1709 search results - page 185 / 342
» networking 2000
Sort
View
SODA
2000
ACM
102views Algorithms» more  SODA 2000»
15 years 7 months ago
Escaping a grid by edge-disjoint paths
We study the edge-disjoint escape problem in grids. Given a set of n sources in a two-dimensional grid, the problem is to connect all sources to the grid boundary using a set of n...
Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting
FIRSTMONDAY
2000
75views more  FIRSTMONDAY 2000»
15 years 6 months ago
Free Riding on Gnutella
An extensive analysis of user traffic on Gnutella shows a significant amount of free riding in the system. By sampling messages on the Gnutella network over a 24-hour period, we e...
Eytan Adar, Bernardo A. Huberman
INFOCOM
2000
IEEE
15 years 10 months ago
Peering and Provisioning of Differentiated Internet Services
A key consideration in building differentiated network services is the feasibility of maintaining stable and consistent service level agreements across multiple networks where allo...
Nemo Semret, Raymond R.-F. Liao, Andrew T. Campbel...
IJCNN
2000
IEEE
15 years 11 months ago
Metrics that Learn Relevance
We introduce an algorithm for learning a local metric to a continuous input space that measures distances in terms of relevance to the processing task. The relevance is defined a...
Samuel Kaski, Janne Sinkkonen
ICDCSW
2000
IEEE
15 years 10 months ago
Compositional Verification of a Third Generation Mobile Communication Protocol
Model-checking has turned out to be an efficient and relatively easy-to-use technique in the verification of formally described programs. However, there is one major drawback in u...
Sari Leppänen, Matti Luukkainen