107
click to vote
CAAN
15 years 2 months ago
2004 Springer 
Imagine a set of self-interested clients, each of whom must choose a server from a permissible set. A server’s latency is inversely proportional to its speed, but it grows linear...
CAAN
15 years 2 months ago
2004 Springer 
The web graph has been the focus of much recent attention, with several stochastic models proposed to account for its various properties. A survey of these models is presented, foc...
CAAN
15 years 2 months ago
2004 Springer
It appeared recently that the classical random graph model used to represent real-world complex networks does not capture their main properties. Since then, various attempts have ...
72
Voted
CAAN
15 years 2 months ago
2004 Springer 
We consider a generalized copy model of the web graph and related networks, and analyze its limiting behaviour. The model is motivated by previously proposed copying models of the ...
CAAN
15 years 2 months ago
2004 Springer 
We study the bandwidth allocation problem Maximize U(x), subject to Ax ≤ c; x ≥ 0 where U is a utility function, x is a bandwidth allocation vector, and Ax ≤ c represent the...
|
Discrete Geometry