Bibliographic record
Abstract
One of the key problems in VLSI interconnect design is the topology construction of signal nets with minimum cost. Steiner tree problem is to find the tree structure that connects all pins of a signal net such that the wire length can be minimized. Since Steiner tree problem is NP-hard, many different heuristics and approximation algorithms have been derived to deal with this problem. However, in VLSI design automation the routing is performed in the presence of obstacles, such as logic cells, where the wires of the net must not intersect. Most of the previous heuristics deal with problems under the assumption that wires do not cross any obstacles. In this study, a class of probabilistic approaches to Steiner tree problem has been extensively explored, which is able to construct Steiner tree with good performance in term of wire length or speed, and able to solve the problem in presence of obstacles. Probabilistic model and a series of algorithms based on it have been established and implemented. Extensive experiments conducted on both small- and large-size problems have been designed to show the performance comparison with the state-of-the-art algorithm. How to deal with blockage and congestion in probabilistic algorithms has been discussed. Also, an optimization algorithm has also been presented, which improves wire length from the results of probabilistic algorithms as well as any other algorithms. In addition, the potential advantages with our approaches are also discussed for further applications.Dept. of Electrical and Computer Engineering. Paper copy at Leddy Library: Theses & Major Papers - Basement, West Bldg. / Call Number: Thesis2002 .Z44. Source: Masters Abstracts International, Volume: 41-04, page: 1162. Adviser: Chunhong Chen. Thesis (M.A.Sc.)--University of Windsor (Canada), 2002.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".