5606 search results - page 304 / 1122 » Randomization Techniques for Graphs. |
138
click to vote
INFOCOM
2006
IEEE
16 years 18 days ago
2006
IEEE
— In this paper, we seek to understand the intrinsic reasons for the well-known phenomenon of heavy-tailed degree in the Internet AS graph and argue that in contrast to tradition...
151
click to vote
SIGMETRICS
2005
ACM
16 years 3 days ago
2005
ACM
—To model P2P networks that are commonly faced with high rates of churn and random departure decisions by end-users, this paper investigates the resilience of random graphs to li...
180
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Reinforcement Learning research is traditionally devoted to solve single-task problems. Therefore, anytime a new task is faced, learning must be restarted from scratch. Recently, ...
154
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
We propose a network characterization of combinatorial fitness landscapes by adapting the notion of inherent networks proposed for energy surfaces [5]. We use the well-known fami...
177
click to vote
TON
2010
15 years 4 months ago
2010
Abstract—In this paper, we seek to understand the intrinsic reasons for the well-known phenomenon of heavy-tailed degree in the Internet AS graph and argue that in contrast to tr...