3020 search results - page 161 / 604 » Optimal partition trees |
171
click to vote
TCAD
2002
15 years 6 months ago
2002
Interconnect optimization for VLSI circuits has received wide attention. To model routing surfaces, multiple circuit layers are freabstracted as a single rectilinear plane, ignori...
170
click to vote
IJKESDP
2010
15 years 5 months ago
2010
—This paper considers k-minimum spanning tree problems. An existing solution algorithm based on tabu search, which was proposed by Katagiri et al., includes an iterative solving ...
171
click to vote
ICCAD
1997
IEEE
15 years 10 months ago
1997
IEEE
In this paper, we study the interconnect layout optimization problem under a higher-order RLC model to optimize not just delay, but also waveform for RLC circuits with non-monoton...
165
click to vote
IUI
2009
ACM
16 years 3 months ago
2009
ACM
The small physical size of mobile devices imposes dramatic restrictions on the user interface (UI). With the ever increasing capacity of these devices as well as access to large o...
175
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...