MétaCan
Menu
Back to cohort
Record W2147638275 · doi:10.1109/ds-rt.2008.20

A Dynamic Area of Interest Management and Collaboration Model for P2P MMOGs

2008· article· en· W2147638275 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
TopicPeer-to-Peer Network Technologies
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsComputer scienceScalabilityOverlay networkOverlayDistributed computingScheme (mathematics)Computer networkProjection (relational algebra)MinimaxAlgorithmMathematical optimizationOperating systemThe Internet

Abstract

fetched live from OpenAlex

In this paper, we present a dynamic area of interest management for massively multiplayer online games (MMOG). Instead of mapping the virtual space to the area of interest (AOI), we scheme AOIs to the virtual space. This zoneless MMOG is the consequence of dynamic AOI that redeems the necessity of inter-AOI communication. In addition, the AOI maintenance cost is reduced significantly by assigning the maintenance responsibility to a subset of players for each AOI. Due to the integration of peer-to-peer communication model to the system, the scalability has improved. To satisfy the timing constraints, the projection of the underling network topology to the overlay network is more fruitful than building the overlay on the fly unintelligently. In response to this fact, the proposed communication model adapts a geometric algorithm which is usually used for minimax problem. The model is evaluated and justified through proper simulation.

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 categoriesnone
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.948
Threshold uncertainty score0.259

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.053
GPT teacher head0.265
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

Quick stats

Citations34
Published2008
Admission routes1
Has abstractyes

Explore more

Same topicPeer-to-Peer Network TechnologiesFrench-language works237,207