Sciweavers

2498 search results - page 145 / 500
» Algorithms for the Topological Watershed
Sort
View
VLSID
2002
IEEE
160views VLSI» more  VLSID 2002»
16 years 6 months ago
An Efficient Hierarchical Timing-Driven Steiner Tree Algorithm for Global Routing
In this paper, we propose a hierarchical timing-driven Steiner tree algorithm for global routing which considers the minimization of timing delay during the tree construction as t...
Jingyu Xu, Xianlong Hong, Tong Jing, Yici Cai, Jun...
ISCC
1999
IEEE
15 years 10 months ago
On Network Survivability Algorithms Based on Trellis Graph Transformations
Due to the wide range of services being supported, telecommunications networks are loaded with massive quantities of information. This stimulates extra concern for network surviva...
Soulla Louca, Andreas Pitsillides, George Samaras
AB
2008
Springer
15 years 8 months ago
The Geometry of the Neighbor-Joining Algorithm for Small Trees
In 2007, Eickmeyer et al. showed that the tree topologies outputted by the Neighbor-Joining (NJ) algorithm and the balanced minimum evolution (BME) method for phylogenetic reconstr...
Kord Eickmeyer, Ruriko Yoshida
IC
2010
15 years 4 months ago
Distributed Algorithms for the Placement of Network Services
Network services play an important role in the Internet today. They serve as data caches for websites, servers for multiplayer games and relay nodes for Voice over IP (VoIP) conver...
Todd Sproull, Roger Chamberlain
ICRA
2009
IEEE
92views Robotics» more  ICRA 2009»
16 years 1 months ago
I-Bug: An intensity-based bug algorithm
— This paper introduces a sensor-based planning algorithm that uses less sensing information than any others within the family of bug algorithms. The robot is unable to access pr...
Kamilah Taylor, Steven M. LaValle