Sciweavers

5785 search results - page 965 / 1157
» Approximability of Probability Distributions
Sort
View
PODC
2005
ACM
15 years 9 months ago
Maximal independent sets in radio networks
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
Thomas Moscibroda, Roger Wattenhofer
SIGECOM
2005
ACM
134views ECommerce» more  SIGECOM 2005»
15 years 9 months ago
Congestion games with failures
We introduce a new class of games, congestion games with failures (CGFs), which extends the class of congestion games to allow for facility failures. In a basic CGF (BCGF) agents ...
Michal Penn, Maria Polukarov, Moshe Tennenholtz
SPAA
2005
ACM
15 years 9 months 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
IPSN
2005
Springer
15 years 9 months ago
Lazy inference on object identities in wireless sensor networks
Tracking the identities of moving objects is an important aspect of most multi-object tracking applications. Uncertainty in sensor data, coupled with the intrinsic difficulty of ...
Jaewon Shin, Nelson Lee, Sebastian Thrun, Leonidas...
MOBICOM
2004
ACM
15 years 9 months ago
Power conservation and quality of surveillance in target tracking sensor networks
Target tracking is an important application of wireless sensor networks. In this application, the sensor nodes collectively monitor and track the movement of an event or target ob...
Chao Gui, Prasant Mohapatra