Sciweavers

1612 search results - page 177 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
120
Voted
STOC
2002
ACM
112views Algorithms» more  STOC 2002»
16 years 2 months ago
Wait-free consensus with infinite arrivals
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
James Aspnes, Gauri Shah, Jatin Shah
SPAA
2005
ACM
15 years 8 months ago
Admission control to minimize rejections and online set cover with repetitions
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
Noga Alon, Yossi Azar, Shai Gutner
126
Voted
EWSN
2009
Springer
16 years 3 months ago
QoS Management for Wireless Sensor Networks with a Mobile Sink
The problem of configuration of Wireless Sensor Networks is an interesting challenge. The objective is to find the settings, for each sensor node, that optimise certain task-level ...
Rob Hoes, Twan Basten, Wai-Leong Yeow, Chen-Khong ...
122
Voted
VTC
2008
IEEE
124views Communications» more  VTC 2008»
15 years 9 months ago
Efficient Reliable Data Collection in Wireless Sensor Networks
— We propose an Efficient Reliable Data Collection (eRDC) algorithm. The eRDC is designed for energy-constraint wireless sensor networks (WSN) to balance reliability and energy c...
Ren Ping Liu, John Zic, Iain B. Collings, Alex Y. ...
108
Voted
CEC
2007
IEEE
15 years 9 months ago
Evolving tiles for automated self-assembly design
Abstract— Self-assembly is a distributed, asynchronous mechanism that is pervasive across natural systems where hierarchical complex structures are built from the bottom-up. The ...
Germán Terrazas, Marian Gheorghe, Graham Ke...