Sciweavers

260 search results - page 47 / 52
» Dynamic Random Geometric Graphs
Sort
View
PPOPP
2012
ACM
13 years 5 months ago
Deterministic parallel random-number generation for dynamic-multithreading platforms
Existing concurrency platforms for dynamic multithreading do not provide repeatable parallel random-number generators. This paper proposes that a mechanism called pedigrees be bui...
Charles E. Leiserson, Tao B. Schardl, Jim Sukha
TROB
2008
93views more  TROB 2008»
14 years 9 months ago
Using Sensor Morphology for Multirobot Formations
In formation-maintenance (formation control) tasks, robots maintain their relative position with respect to their peers, according to a desired geometric shape. Previous work has e...
Gal A. Kaminka, Ruti Schechter-Glick, Vladimir Sad...
MOBIHOC
2007
ACM
15 years 9 months ago
Capacity scaling in delay tolerant networks with heterogeneous mobile nodes
We provide a general framework for the analysis of the capacity scaling properties in mobile ad-hoc networks with heterogeneous nodes and spatial inhomogeneities. Existing analyti...
Michele Garetto, Paolo Giaccone, Emilio Leonardi
ICCAD
1999
IEEE
181views Hardware» more  ICCAD 1999»
15 years 2 months ago
A new heuristic for rectilinear Steiner trees
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
Ion I. Mandoiu, Vijay V. Vazirani, Joseph L. Ganle...
TSP
2010
14 years 4 months ago
Optimization and analysis of distributed averaging with short node memory
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
Boris N. Oreshkin, Mark Coates, Michael G. Rabbat