MétaCan
Menu
Back to cohort
Record W4415528645 · doi:10.1002/9781394296262.ch3

Animal‐Behavior‐Inspired Algorithms in Analog Circuit Sizing Optimization

2025· other· en· W4415528645 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typeother
Languageen
FieldComputer Science
TopicEvolutionary Algorithms and Applications
Canadian institutionsMemorial University of Newfoundland
Fundersnot available
KeywordsFirefly algorithmCuckoo searchMetaheuristicParticle swarm optimizationPopulationAnt colony optimization algorithmsSizingExtremal optimization

Abstract

fetched live from OpenAlex

This chapter introduces various optimization algorithms inspired by both fauna and flora behaviors, including reproduction, foraging, preying, and the balance between exploration and exploitation. The optimization algorithms include particle swarm optimization, ant colony optimization, bat algorithm, firefly algorithm (FA), cuckoo search (CS) and flower pollination algorithm. Most of these algorithms exhibit underlying characteristics of exploration and exploitation processes based on individual or group experiences in choosing the best individuals or strategies to reach their targets. This analogy to integrated circuit designs highlights their potential application, further clarified through a case study of implementing the CS algorithm in BGR circuit design. FA is designed to solve global optimization problems, where each firefly individual in the population interacts with others based on their brightness. The chapter explores the method of employing various renowned metaheuristic optimization algorithms aimed at maximizing the power supply rejection ratio parameter of the BGR circuit.

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.

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 categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.757
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0010.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.019
GPT teacher head0.260
Teacher spread0.241 · 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

Quick stats

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same topicEvolutionary Algorithms and ApplicationsFrench-language works237,207