MétaCan
Menu
Back to cohort
Record W2061264770 · doi:10.1145/1809036.1809045

Adapting environment-mediated self-organizing emergent systems by exception rules

2010· article· en· W2061264770 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
Typearticle
Languageen
FieldEngineering
TopicModular Robots and Swarm Intelligence
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsComputer scienceProcess (computing)Set (abstract data type)Self-organizationWork (physics)Order (exchange)Adaptive systemArtificial intelligenceEngineering

Abstract

fetched live from OpenAlex

Due to the absence of global knowledge, elements in a self-organizing emergent system tend to make suboptimal local decisions that result in globally inefficient solutions. However, improving the solutions of such systems, which work in a bottom-up style, by the principles of self-adaptive systems, which work in a top-down style, is not a straight forward process. In this paper, we present challenges and constraints that have to be respected during this process and describe early work on an approach, how to autonomously adapt the local behavior of self-organizing elements by so-called exception rules in order to improve the performance of the global solution. In particular, we present a set of exception rules that can be employed in different situations for the improvement of environment-mediated, self-organizing emergent solutions to pickup and delivery problems.

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 categoriesInsufficient payload (model declined to judge)
Consensus categoriesInsufficient payload (model declined to judge)
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.877
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.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.0010.001

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.006
GPT teacher head0.169
Teacher spread0.163 · 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

Citations5
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicModular Robots and Swarm IntelligenceFrench-language works237,207