MétaCan
Menu
Back to cohort

Enhancing the GA's ability to cope with dynamic environments

2000· article· en· W6539208 on OpenAlexaff
Mark Wineberg, Franz Oppacher

Bibliographic record

VenueGenetic and Evolutionary Computation Conference · 2000
Typearticle
Languageen
FieldComputer Science
TopicEvolutionary Algorithms and Applications
Canadian institutionsCarleton University
Fundersnot available
KeywordsComputer scienceGenetic algorithmBalance (ability)Distributed computingDynamic balanceWrightFlexibility (engineering)Machine learningEngineeringProgramming languageMathematicsBiology

Abstract

fetched live from OpenAlex

The Shifting Balance Genetic Algorithm (SBGA) is a pluggable module for a GA (or any other Evolutionary Algorithm) based on a modification of Sewall Wright's shifting balance theory. The SBGA is intended to enhance a GA's ability to adapt to a changing environment. Here we describe the detailed mechanisms required to implement the SBGA as well as an experiment that shows that the SBGA not only outperforms the GA in a difficult dynamic environment, but actually seems to thrive in such an environment.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation 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.001
Threshold uncertainty score0.003

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0010.000
Open science0.0010.000
Research integrity0.0010.001
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.008
GPT teacher head0.220
Teacher spread0.212 · 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 source (direct Gemma or distilled Codex), 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

Citations47
Published2000
Admission routes1
Has abstractyes

Explore more

Same venueGenetic and Evolutionary Computation ConferenceSame topicEvolutionary Algorithms and ApplicationsFrench-language works237,207