Sciweavers

13214 search results - page 390 / 2643
» Pseudorandomness for network algorithms
Sort
View
AI
2011
Springer
15 years 1 months ago
Bounded approximate decentralised coordination via the max-sum algorithm
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
Alex Rogers, Alessandro Farinelli, Ruben Stranders...
SYNASC
2007
IEEE
106views Algorithms» more  SYNASC 2007»
16 years 1 months ago
P2P Open Agent Networks for Decision Making
Vladimir Gorodetsky, Oleg Karsaev, Vladimir Samoil...
ESA
2007
Springer
117views Algorithms» more  ESA 2007»
16 years 1 months ago
Fast Low Degree Connectivity of Ad-Hoc Networks Via Percolation
Emilio De Santis, Fabrizio Grandoni, Alessandro Pa...
ISAAC
2004
Springer
88views Algorithms» more  ISAAC 2004»
16 years 6 days ago
The Maximum Agreement of Two Nested Phylogenetic Networks
Jesper Jansson, Wing-Kin Sung
ESA
2003
Springer
98views Algorithms» more  ESA 2003»
16 years 2 days ago
Approximating Energy Efficient Paths in Wireless Multi-hop Networks
Stefan Funke, Domagoj Matijevic, Peter Sanders