64 search results - page 2 / 13 » Distributed Spanning Tree Algorithms for Large Scale Travers... |
ICRA
2005
IEEE
13 years 10 months ago
2005
IEEE
Abstract— High-dimensional problems arising from complex robotic systems test the limits of current motion planners and require the development of efficient distributed motion p...
TCAD
2008
13 years 4 months ago
2008
Given a set of pins and a set of obstacles on routing layers, a multilayer obstacle-avoiding rectilinear Steiner minimal tree (ML-OARSMT) connects these pins by rectilinear edges w...
ICPP
2008
IEEE
13 years 11 months ago
2008
IEEE
Solving large, irregular graph problems efficiently is challenging. Current software systems and commodity multiprocessors do not support fine-grained, irregular parallelism wel...
SIGCOMM
2000
ACM
13 years 9 months ago
2000
ACM
As the number of hosts attached to a network increases beyond what can be connected by a single local area network (LAN), forwarding packets between hosts on different LANs become...
PATMOS
2004
Springer
13 years 10 months ago
2004
Springer
Motivated by very/ultra large scale integrated circuit (VLSI/ULSI) physical design applications, we study the construction of rectilinear minimum spanning tree (RMST) with its maxi...