Sciweavers

2926 search results - page 145 / 586
» Partially Optimal Routing
Sort
View
AIPS
2003
15 years 4 months ago
Optimal Rectangle Packing: Initial Results
Given a set of rectangles with fixed orientations, we want to find an enclosing rectangle of minimum area that contains them all with no overlap. Many simple scheduling tasks ca...
Richard E. Korf
ICCD
2004
IEEE
103views Hardware» more  ICCD 2004»
16 years 4 days ago
A Two-Layer Bus Routing Algorithm for High-Speed Boards
The increasing clock frequencies in high-end industrial circuits bring new routing challenges that can not be handled by traditional algorithms. An important design automation pro...
Muhammet Mustafa Ozdal, Martin D. F. Wong
ASPDAC
2005
ACM
73views Hardware» more  ASPDAC 2005»
15 years 8 months ago
An-OARSMan: obstacle-avoiding routing tree construction with good length performance
- Routing is one of the important steps in VLSI/ULSI physical design. The rectilinear Steiner minimum tree (RSMT) construction is an essential part of routing. Since macro cells, I...
Yu Hu, Tong Jing, Xianlong Hong, Zhe Feng 0002, Xi...
ISPD
1999
ACM
95views Hardware» more  ISPD 1999»
15 years 7 months ago
Incremental capacitance extraction and its application to iterative timing-driven detailed routing
In this paper, we consider delay optimization in multilayer detailed routing. Given a detailed routing by some detailed router, we iteratively improve the delays of critical nets ...
Yanhong Yuan, Prithviraj Banerjee
PE
2002
Springer
109views Optimization» more  PE 2002»
15 years 2 months ago
Non-cooperative routing in loss networks
The paper studies routing in loss networks in the framework of a non-cooperative game with selfish users. Two solution concepts are considered: the Nash equilibrium, corresponding...
Eitan Altman, Rachid El Azouzi, Vyacheslav M. Abra...