Sciweavers

362 search results - page 29 / 73
» A distributed auction algorithm for the assignment problem
Sort
View
ATAL
2010
Springer
13 years 8 months ago
A decentralised coordination algorithm for minimising conflict and maximising coverage in sensor networks
In large wireless sensor networks, the problem of assigning radio frequencies to sensing agents such that no two connected sensors are assigned the same value (and will thus inter...
Ruben Stranders, Alex Rogers, Nicholas R. Jennings
IPPS
2008
IEEE
14 years 2 months ago
Absolute Slicing in Peer-to-peer Systems
Peer-to-peer (P2P) systems are slowly moving from application-specific architectures to a generic serviceoriented design framework. The idea is to allow a dynamic collection of P...
Alberto Montresor, Roberto Zandonati
ICDCS
2007
IEEE
14 years 2 months ago
Distributed Slicing in Dynamic Systems
Peer to peer (P2P) systems are moving from application specific architectures to a generic service oriented design philosophy. This raises interesting problems in connection with...
Antonio Fernández, Vincent Gramoli, Ernesto...
SODA
2010
ACM
157views Algorithms» more  SODA 2010»
14 years 5 months ago
Testing monotone high-dimensional distributions
A monotone distribution P over a (partially) ordered domain assigns higher probability to y than to x if y x in the order. We study several natural problems concerning testing pr...
Ronitt Rubinfeld, Rocco A. Servedio
TON
2002
91views more  TON 2002»
13 years 7 months ago
The stable paths problem and interdomain routing
Abstract-Dynamic routing protocols such as RIP and OSPF essentially implement distributed algorithms for solving the Shortest Paths Problem. The Border Gateway Protocol (BGP) is cu...
Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilf...