Sciweavers

1370 search results - page 184 / 274
» On grids in topological graphs
Sort
View
INFOCOM
2009
IEEE
15 years 6 months ago
Lightweight Coloring and Desynchronization for Networks
—We study the distributed desynchronization problem for graphs with arbitrary topology. Motivated by the severe computational limitations of sensor networks, we present a randomi...
Arik Motskin, Tim Roughgarden, Primoz Skraba, Leon...
CDC
2008
IEEE
144views Control Systems» more  CDC 2008»
15 years 6 months ago
On the convergence time of distributed quantized averaging algorithms
— We come up with novel quantized averaging algorithms on synchronous and asynchronous communication networks with fixed, switching and random topologies. The implementation of ...
Minghui Zhu, Sonia Martínez
IROS
2006
IEEE
204views Robotics» more  IROS 2006»
15 years 6 months ago
Distributed Sensing and Prediction of Obstacle Motions for Mobile Robot Motion Planning
— This work recommends an architecture and its fundamental components for motion planning for mobile robots in dynamic environments. An adaptive behavior to typical motion patter...
Thorsten Rennekamp, Kai Homeier, Torsten Kroeger
DATE
1997
IEEE
133views Hardware» more  DATE 1997»
15 years 4 months ago
Hierarchical scheduling and allocation of multirate systems on heterogeneous multiprocessors
This paper describes new algorithms for systemlevel software synthesis, namely the scheduling and allocation of a set of complex tasks running at multiple rates on a heterogeneous...
Yanbing Li, Wayne Wolf
APPINF
2003
15 years 1 months ago
Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks
In this paper we present optimum interval routing algorithms for message passing networks that have topological structure defined by k-caterpillars and maximal outer planar graph...
Gur Saran Adhar