MétaCan
Menu
Back to cohort
Record W2092947797 · doi:10.1145/376656.376851

Scalable multi-agent systems

2001· article· en· W2092947797 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
FieldComputer Science
TopicMobile Agent-Based Network Management
Canadian institutionsUniversity of Saskatchewan
Fundersnot available
KeywordsComputer scienceScalabilityJavaCommon Object Request Broker ArchitectureMulti-agent systemLayer (electronics)Distributed computingSoftware engineeringComputer securityOperating systemArtificial intelligence

Abstract

fetched live from OpenAlex

The multi-agent research community is currently faced with a paradox. While promoting the use of agents as the silver bullet for various software engineering problems, it faces difficulties in presenting successful deployments. Despite the countless multi-agent prototypes that have been developed, the number of actually deployed and in use MAS is at best very small [1]. One reason for the noticeable absence of deployed multi-agent systems is their inability to scale. This paper reports about the use of a CORBA/Java middle-ware layer called DICE, which enables transparent access to the resources of different physical machines. Using this layer it becomes possible to build large multi-agent systems that require large numbers of concurrent threads and significant memory resources. Using DICE it becomes possible to build large agent societies consisting of complex agents defined in JESS.

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 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.895
Threshold uncertainty score0.999

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.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.029
GPT teacher head0.242
Teacher spread0.213 · 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

Citations6
Published2001
Admission routes1
Has abstractyes

Explore more

Same topicMobile Agent-Based Network ManagementFrench-language works237,207