Sciweavers

71 search results - page 10 / 15
» Theory of Rumour Spreading in Complex Social Networks
Sort
View
ICCS
2009
Springer
14 years 2 months ago
Simulating Individual-Based Models of Epidemics in Hierarchical Networks
Current mathematical modeling methods for the spreading of infectious diseases are too simplified and do not scale well. We present the Simulator of Epidemic Evolution in Complex ...
Rick Quax, David A. Bader, Peter M. A. Sloot
SIVP
2010
118views more  SIVP 2010»
13 years 6 months ago
Self-organization of sensor networks for detection of pervasive faults
Resource aware operation of sensor networks requires adaptive re-organization to dynamically adapt to the operational environment. A complex dynamical system of interacting compone...
Abhishek Srivastav, Asok Ray
FCT
2009
Springer
14 years 2 months ago
Computing Role Assignments of Chordal Graphs
In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...
Pim van 't Hof, Daniël Paulusma, Johan M. M. ...
CN
2007
111views more  CN 2007»
13 years 7 months ago
An auction mechanism for allocating the bandwidth of networks to their users
We present a mechanism for auctioning bandwidth on a network-wide basis to end users or ISPs that will utilize it for the same time period. This mechanism consists of a set of sim...
Manos Dramitinos, George D. Stamoulis, Costas Cour...
SIGECOM
2005
ACM
101views ECommerce» more  SIGECOM 2005»
14 years 1 months ago
Fairness and optimality in congestion games
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general prob...
Deeparnab Chakrabarty, Aranyak Mehta, Viswanath Na...