MétaCan
Menu
Back to cohort
Record W2101693825 · doi:10.1109/ccece.2005.1557360

Novel approaches to placement

2006· article· en· W2101693825 on OpenAlexaff
William L. Kocay, R.D. McLeod

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicVLSI and FPGA Design Techniques
Canadian institutionsUniversity of Manitoba
Fundersnot available
KeywordsComputer sciencePlanar graphPlanarTheoretical computer scienceVery-large-scale integrationGraphConjectureGraph drawingElectronic circuitComputer engineeringMathematicsComputer graphics (images)

Abstract

fetched live from OpenAlex

This paper was motivated by recent research in placement algorithms for VLSI circuits and attempts to visualize the connectivity and underlying physics associated with large networks or Internets. In both cases, these are graph problems made difficult by the inherent complexity of the problem (NPC) in conjunction with the size of the problem. In this work we present two useful alternatives for the layout of a graph in a manner as planar as possible. The conjecture being that if the initial placement or drawing is as close planar as possible it makes for more efficient post or subsequent processing. The notion which makes these methods potentially attractive here are in part due to the underlying application where there is a dichotomy in types of nodes being placed.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: Bench or experimental
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.920
Threshold uncertainty score0.200

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.067
GPT teacher head0.194
Teacher spread0.127 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designBench or experimental
Domainnot available
GenreEmpirical

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".

Quick stats

Citations0
Published2006
Admission routes1
Has abstractyes

Explore more

Same topicVLSI and FPGA Design TechniquesFrench-language works237,207