Sciweavers

862 search results - page 27 / 173
» Random Information Spread in Networks
Sort
View
74
Voted
CIKM
2009
Springer
15 years 6 months ago
Collaborative filtering using random neighbours in peer-to-peer networks
Traditionally, collaborative filtering (CF) algorithms used for recommendation operate on complete knowledge. This makes these algorithms hard to employ in a decentralized contex...
Arno Bakker, Elth Ogston, Maarten van Steen
WSC
2007
15 years 2 months ago
Using empirical demand data and common random numbers in an agent-based simulation of a distribution network
Agent-based simulation provides a methodology to investigate complex systems behavior, such as supply chains, while incorporating many empirical elements relative to both systems ...
William J. Sawaya
EWSN
2006
Springer
15 years 11 months ago
Sensor Density for Complete Information Coverage in Wireless Sensor Networks
Abstract. Coverage is a very important issue in wireless sensor networks. Current literature defines a point to be covered if it is within the sensing radius of at least one sensor...
Bang Wang, Kee Chaing Chua, Vikram Srinivasan, Wei...
IEEEMSP
2002
IEEE
166views Multimedia» more  IEEEMSP 2002»
15 years 4 months ago
Medium access control with channel state information for large sensor networks
Abstract—Traditionally, random access protocols have been designed and studied by assuming simple models for the physical layer. We introduce a reception model that incorporates ...
Srihari Adireddy, Lang Tong
MSWIM
2005
ACM
15 years 5 months ago
Hop distances and flooding in wireless multihop networks with randomized beamforming
We show that randomized beamforming is a simple yet efficient communication strategy in wireless multihop networks if no neighbor location information is at hand. Already small an...
Robert Vilzmann, Christian Bettstetter, Daniel Med...