Sciweavers

1578 search results - page 30 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
TCAD
2008
119views more  TCAD 2008»
13 years 8 months ago
Full-Chip Routing Considering Double-Via Insertion
As the technology node advances into the nanometer era, via-open defects are one of the dominant failures due to the copper cladding process. To improve via yield and reliability, ...
Huang-Yu Chen, Mei-Fang Chiang, Yao-Wen Chang, Lum...
AINA
2009
IEEE
14 years 3 months ago
A Fast and Memory Efficient Dynamic IP Lookup Algorithm Based on B-Tree
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
Yeim-Kuan Chang, Yung-Chieh Lin
INFOCOM
2009
IEEE
14 years 3 months ago
Novel Architectures and Algorithms for Delay Reduction in Back-Pressure Scheduling and Routing
—The back-pressure algorithm is a well-known throughput-optimal algorithm. However, its delay performance may be quite poor even when the traffic load is not close to network ca...
Loc Bui, R. Srikant, Alexander L. Stolyar
EMO
2009
Springer
235views Optimization» more  EMO 2009»
14 years 3 months ago
Bi-objective Optimization for the Vehicle Routing Problem with Time Windows: Using Route Similarity to Enhance Performance
Abstract. The Vehicle Routing Problem with Time Windows is a complex combinatorial optimization problem which can be seen as a fusion of two well known sub-problems: the Travelling...
Abel Garcia-Najera, John A. Bullinaria
CSCWD
2008
Springer
13 years 10 months ago
Computer aided architectural design: Wayfinding complexity analysis
Design is a complex process often described as a collaboration between a designer and herself. In architectural design, a designer must consider the selection of a subset of actio...
Brett Bojduj, Ben Weber, Kai-Florian Richter, Sven...