Sciweavers

2294 search results - page 276 / 459
» From Path Graphs to Directed Path Graphs
Sort
View
WADS
2001
Springer
86views Algorithms» more  WADS 2001»
15 years 7 months ago
Practical Approximation Algorithms for Separable Packing Linear Programs
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu,...
ICRA
2000
IEEE
180views Robotics» more  ICRA 2000»
15 years 7 months ago
Interactive Motion Planning Using Hardware-Accelerated Computation of Generalized Voronoi Diagrams
We present techniques for fast motion planning by using discrete approximations of generalized Voronoi diagrams, computed with graphics hardware. Approaches based on this diagram ...
Kenneth E. Hoff III, Tim Culver, John Keyser, Ming...
DSN
2009
IEEE
15 years 6 months ago
Precise request tracing and performance debugging for multi-tier services of black boxes
As more and more multi-tier services are developed from commercial components or heterogeneous middleware without the source code available, both developers and administrators nee...
Zhihong Zhang, Jianfeng Zhan, Yong Li, Lei Wang, D...
132
Voted
CN
2010
103views more  CN 2010»
15 years 3 months ago
Continuum equilibria and global optimization for routing in dense static ad hoc networks
We consider massively dense ad hoc networks and study their continuum limits as the node density increases and as the graph providing the available routes becomes a continuous area...
Alonso Silva, Eitan Altman, Pierre Bernhard, M&eac...
102
Voted
ENVSOFT
2006
76views more  ENVSOFT 2006»
15 years 3 months ago
LQGraph: A software package for optimizing connectivity in conservation planning
LQGraph implements methods for optimizing the connectivity of sites administered to protect biodiversity (a conservation area network). The methods are suitable for existing prote...
Trevon Fuller, Sahotra Sarkar