Heuristic search in general tree structures

Author(s):  
A. Bagchi ◽  
Anup K. Sen
2002 ◽  
Vol 716 ◽  
Author(s):  
C. L. Gan ◽  
C. V. Thompson ◽  
K. L. Pey ◽  
W. K. Choi ◽  
F. Wei ◽  
...  

AbstractElectromigration experiments have been carried out on simple Cu dual-damascene interconnect tree structures consisting of straight via-to-via (or contact-to-contact) lines with an extra via in the middle of the line. As with Al-based interconnects, the reliability of a segment in this tree strongly depends on the stress conditions of the connected segment. Beyond this, there are important differences in the results obtained under similar test conditions for Al-based and Cu-based interconnect trees. These differences are thought to be associated with variations in the architectural schemes of the two metallizations. The absence of a conducting electromigrationresistant overlayer in Cu technology, and the possibility of liner rupture at stressed vias lead to significant differences in tree reliabilities in Cu compared to Al.


Author(s):  
Jeffrey L. Adler

For a wide range of transportation network path search problems, the A* heuristic significantly reduces both search effort and running time when compared to basic label-setting algorithms. The motivation for this research was to determine if additional savings could be attained by further experimenting with refinements to the A* approach. We propose a best neighbor heuristic improvement to the A* algorithm that yields additional benefits by significantly reducing the search effort on sparse networks. The level of reduction in running time improves as the average outdegree of the network decreases and the number of paths sought increases.


2021 ◽  
Vol 69 (1) ◽  
pp. 356-365
Author(s):  
Bariscan Karaosmanoglu ◽  
Ozgur Ergul
Keyword(s):  

2021 ◽  
Vol 426 ◽  
pp. 35-46
Author(s):  
Xiangyuan Tan ◽  
Xiaoguang Gao ◽  
Zidong Wang ◽  
Chuchao He

Sign in / Sign up

Export Citation Format

Share Document