Sciweavers

4377 search results - page 666 / 876
» Mass problems and randomness
Sort
View
SPAA
2006
ACM
16 years 15 days ago
Playing push vs pull: models and algorithms for disseminating dynamic data in networks
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...
R. C. Chakinala, Abishek Kumarasubramanian, Kofi A...
INFOCOM
2005
IEEE
16 years 4 days ago
Dynamic node activation in networks of rechargeable sensors
— We consider a network of rechargeable sensors, deployed redundantly in a random sensing environment, and address the problem of how sensor nodes should be activated dynamically...
Koushik Kar, Ananth Krishnamurthy, Neeraj Jaggi
P2P
2005
IEEE
106views Communications» more  P2P 2005»
16 years 4 days ago
Chord on Demand
Structured peer-to-peer overlay networks are now an established paradigm for implementing a wide range of distributed services. While the problem of maintaining these networks in ...
Alberto Montresor, Márk Jelasity, Özal...
SPAA
2005
ACM
16 years 3 days ago
Dynamic page migration with stochastic requests
The page migration problem is one of subproblems of data management in networks. It occurs in a distributed network of processors sharing one indivisible memory page of size D. Du...
Marcin Bienkowski
WS
2005
ACM
16 years 3 days ago
A framework for MAC protocol misbehavior detection in wireless networks
The pervasiveness of wireless devices and the architectural organization of wireless networks in distributed communities, where no notion of trust can be assumed, are the main rea...
Svetlana Radosavac, John S. Baras, Iordanis Koutso...