Sciweavers

1434 search results - page 209 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
SPAA
2004
ACM
14 years 3 months ago
Pagoda: a dynamic overlay network for routing, data management, and multicasting
The tremendous growth of public interest in peer-to-peer systems in recent years has initiated a lot of research work on how to design efficient and robust overlay networks for t...
Ankur Bhargava, Kishore Kothapalli, Chris Riley, C...
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
14 years 2 months ago
Equilibria in topology control games for ad hoc networks
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
Stephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust
TCS
2002
13 years 9 months ago
Process algebra for performance evaluation
This paper surveys the theoretical developments in the field of stochastic process algebras, process algebras where action occurrences may be subject to a delay that is determined...
Holger Hermanns, Ulrich Herzog, Joost-Pieter Katoe...
DCOSS
2011
Springer
12 years 9 months ago
Planning the trajectories of multiple mobile sinks in large-scale, time-sensitive WSNs
—Controlled sink mobility has been shown to be very beneficial in lifetime prolongation of wireless sensor networks (WSNs) by avoiding the typical hot-spot problem near the sink...
Wint Yi Poe, Michael Beck, Jens B. Schmitt
SIGECOM
2008
ACM
138views ECommerce» more  SIGECOM 2008»
13 years 9 months ago
Generalized scoring rules and the frequency of coalitional manipulability
We introduce a class of voting rules called generalized scoring rules. Under such a rule, each vote generates a vector of k scores, and the outcome of the voting rule is based onl...
Lirong Xia, Vincent Conitzer