862 search results - page 44 / 173 » Random Information Spread in Networks |
100
Voted
GLOBECOM
2006
IEEE
15 years 8 months ago
2006
IEEE
— Due to the real time nature and buddy list presence information of Instant Messaging (IM) systems worms can spread over IM networks rapidly, causing severe damages, however, it...
CORR
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. We introduce four algorithms for packet transport in complex networks. These algorithms use deterministic rules which depend, in different ways, on the degree of the node...
119
click to vote
APNOMS
2006
Springer
15 years 5 months ago
2006
Springer
In this paper, we propose the localized adaptive QoS routing scheme using POMDP(partially observable Markov Decision Processes) and Exploration Bonus. In order to deal with POMDP p...
108
click to vote
CORR
2006
Springer
15 years 1 months ago
2006
Springer
Gossip algorithms for aggregation have recently received significant attention for sensor network applications because of their simplicity and robustness in noisy and uncertain en...
118
click to vote
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
We consider distributed algorithms to optimize random access multihop wireless networks in the presence of fading. Since the associated optimization problem is neither convex nor ...