MétaCan
Menu
Back to cohort
Record W1750273152 · doi:10.1109/iscas.1993.394055

Circuit partitioning using a Tabu search approach

2002· article· en· W1750273152 on OpenAlexaff
Shawki Areibi, Anthony Vannelli

Bibliographic record

Venue1993 IEEE International Symposium on Circuits and Systems · 2002
Typearticle
Languageen
FieldEngineering
TopicVLSI and FPGA Design Techniques
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsTabu searchNetlistSimulated annealingGuided Local SearchHill climbingComputer scienceMathematical optimizationJob shop schedulingAlgorithmTheoretical computer scienceMathematicsSchedule

Abstract

fetched live from OpenAlex

Tabu Search is a simple combinatorial optimization strategy that has been applied in graph coloring, scheduling, and space planning. The application of the Tabu Search heuristic to the circuit partitioning problem is described. Results obtained indicate that in most cases Tabu Search yields netlist partitions with 10% fewer cut nets than the best netlist partitions obtained by using an interchange method or simulated annealing. The Tabu Search method is 3 to 20 times faster than simulated annealing on tested problems. The benefit of integrating Tabu Search with simulated annealing is discussed.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.629
Threshold uncertainty score0.780

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.080
GPT teacher head0.257
Teacher spread0.177 · 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 designSimulation or modeling
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

Citations23
Published2002
Admission routes1
Has abstractyes

Explore more

Same venue1993 IEEE International Symposium on Circuits and SystemsSame topicVLSI and FPGA Design TechniquesFrench-language works237,207