6251 search results - page 79 / 1251 » Randomness, Computability, and Density |
99
Voted
VTC
2006
IEEE
15 years 9 months ago
2006
IEEE
— Mobility models are widely used in simulation-based performance analyses of mobile networks. However, there is a trade-off between simplicity and realistic movement patterns. S...
136
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We present a simple and efficient algorithm for randomly generating simple graphs without small cycles. These graphs can be used to design high performance Low-Density Parity-Chec...
125
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
We investigate a prototypical agent-based model, the Naming Game, on random geometric networks. The Naming Game is a minimal model, employing local communications that captures th...
124
Voted
CGF
2008
15 years 3 months ago
2008
In many business applications, large data workloads such as sales figures or process performance measures need to be monitored in real-time. The data analysts want to catch proble...
108
click to vote
SIGECOM
2006
ACM
15 years 9 months ago
2006
ACM
We study a natural extension of classical evolutionary game theory to a setting in which pairwise interactions are restricted to the edges of an undirected graph or network. We ge...