Sciweavers

TSP
2008
106views more  TSP 2008»
13 years 6 months ago
Distributed Spectrum Management Algorithms for Multiuser DSL Networks
Modern digital subscriber line (DSL) networks suffer from crosstalk among different lines in the same cable bundle. This crosstalk can lead to a major performance degradation. By b...
Paschalis Tsiaflakis, Moritz Diehl, Marc Moonen
CORR
2007
Springer
88views Education» more  CORR 2007»
13 years 6 months ago
Target assignment for robotic networks: asymptotic performance under limited communication
— We are given an equal number of mobile robotic agents, and distinct target locations. Each agent has simple integrator dynamics, a limited communication range, and knowledge of...
Stephen L. Smith, Francesco Bullo
SODA
2003
ACM
122views Algorithms» more  SODA 2003»
13 years 7 months ago
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorithms for two problems. Given a network, we first show how to compute connected a...
Devdatt P. Dubhashi, Alessandro Mei, Alessandro Pa...
OPODIS
2004
13 years 7 months ago
A Novel Distributed Scheduling Algorithm for Resource Sharing Under Near-Heavy Load
This paper introduces SERH
D. Carvalho, Fábio Protti, Massimo De Grego...
FORTE
2010
13 years 8 months ago
On Efficient Models for Model Checking Message-Passing Distributed Protocols
Abstract. The complexity of distributed algorithms, such as state machine replication, motivates the use of formal methods to assist correctness verification. The design of the for...
Péter Bokor, Marco Serafini, Neeraj Suri
ALENEX
2007
102views Algorithms» more  ALENEX 2007»
13 years 8 months ago
Linearization: Locally Self-Stabilizing Sorting in Graphs
We consider the problem of designing a distributed algorithm that, given an arbitrary connected graph G of nodes with unique labels, converts G into a sorted list of nodes. This a...
Melih Onus, Andréa W. Richa, Christian Sche...
CIAC
2006
Springer
100views Algorithms» more  CIAC 2006»
13 years 10 months ago
Distributed Approximation Algorithms for Planar Graphs
In this paper we construct two distributed algorithms for computing approximations of a largest matching and a minimum dominating set in planar graphs on n vertices. The approximat...
Andrzej Czygrinow, Michal Hanckowiak, Edyta Szyman...
ITICSE
1999
ACM
13 years 10 months ago
Distributed algorithms visualisation for educational purposes
We present our work on building interactive continuous visualisations of distributed algorithms for educational purposes. The animations are comprised by a set of visualisation wi...
Boris Koldehofe, Marina Papatriantafilou, Philippa...
ICNP
2002
IEEE
13 years 11 months ago
Distributed Collaborative Key Agreement Protocols for Dynamic Peer Groups
We consider several distributed collaborative key agreement protocols for dynamic peer groups. This problem has several important characteristics which make it different from trad...
Patrick P. C. Lee, John C. S. Lui, David K. Y. Yau
ICALP
2003
Springer
13 years 11 months ago
Online Load Balancing Made Simple: Greedy Strikes Back
We provide a new simpler approach to the on-line load balancing problem in the case of restricted assignment of temporary weighted tasks. The approach is very general and allows to...
Pierluigi Crescenzi, Giorgio Gambosi, Gaia Nicosia...