Sciweavers

1040 search results - page 188 / 208
» A Distributed Algorithm for Joins in Sensor Networks
Sort
View
CCR
2006
117views more  CCR 2006»
13 years 7 months ago
Efficient and decentralized computation of approximate global state
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
S. Keshav
COMCOM
2004
98views more  COMCOM 2004»
13 years 7 months ago
End system multicast: an architectural infrastructure and topological optimization
Although IP-multicast has been proposed and investigated for years, there are major problems inherent in the IP-multicasting technique, e.g., difficulty to scale up the system, di...
Starsky H. Y. Wong, John C. S. Lui
ATAL
2005
Springer
14 years 1 months ago
Task inference and distributed task management in the Centibots robotic system
We describe a very large scale distributed robotic system, involving a team of over 100 robots, that has been successfully deployed in large, unknown indoor environments, over ext...
Charlie Ortiz, Régis Vincent, Benoit Moriss...
GECCO
2008
Springer
146views Optimization» more  GECCO 2008»
13 years 8 months ago
A formal performance modeling framework for bio-inspired ad hoc routing protocols
Bio-inspired ad hoc routing is an active area of research. The designers of these algorithms predominantly evaluate the performance of their protocols with the help of simulation ...
Muhammad Saleem, Syed Ali Khayam, Muddassar Farooq
WDAG
2009
Springer
154views Algorithms» more  WDAG 2009»
14 years 2 months ago
Compact Multicast Routing
In a distributed network, a compact multicast scheme is a routing scheme that allows any source to send messages to any set of targets. We study the trade-off between the space us...
Ittai Abraham, Dahlia Malkhi, David Ratajczak