21 search results - page 1 / 5 » Distributed random digraph transformations for peer-to-peer ... |
SPAA
2006
ACM
14 years 6 days ago
2006
ACM
SPAA
2005
ACM
13 years 11 months ago
2005
ACM
We present k-Flipper, a graph transformation algorithm that transforms regular undirected graphs. Given a path of k +2 edges it interchanges the end vertices of the path. By defin...
IPPS
1998
IEEE
13 years 10 months ago
1998
IEEE
Abstract. We give a high-level description of some fundamental randomized and deterministic techniques for routing and sorting on xedconnection networks such as meshes, hypercubes ...
EURONGI
2006
Springer
13 years 10 months ago
2006
Springer
Wireless sensor networks (WSNs) pose challenges not present in classical distributed systems: resource limitations, high failure rates, and ad hoc deployment. The lossy nature of w...
IPCO
2010
13 years 7 months ago
2010
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...