MétaCan
Menu
Back to cohort
Record W2075414864 · doi:10.1109/vetecs.2010.5493662

Inter-Cell Interference Coordination in OFDMA Networks: A Novel Approach Based on Integer Programming

2010· article· en· W2075414864 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
TopicAdvanced Wireless Network Optimization
Canadian institutionsCarleton University
Fundersnot available
KeywordsThroughputComputer scienceInterference (communication)Scheme (mathematics)Integer programmingEnhanced Data Rates for GSM EvolutionMathematical optimizationBinary numberLinear programmingInteger (computer science)AlgorithmMathematicsComputer networkTelecommunicationsWirelessChannel (broadcasting)

Abstract

fetched live from OpenAlex

We study a dynamic inter-cell interference coordination scheme formulated using a novel binary integer linear programming optimization technique. The scheme aims to maximize utility, where different utility measures have been defined to model varying levels of user fairness. The formulated problem is decomposed into a number of smaller sub-problems and solved iteratively to ease the computational complexity. We observe the cell-edge and sector throughput as well as user fairness and compare with a reference scheme, where interference coordination is not used. It is observed that the proposed scheme always outperforms the reference scheme in terms of cell-edge and sector throughput as well as in fairness.

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: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.879
Threshold uncertainty score0.803

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.001
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.007
GPT teacher head0.202
Teacher spread0.195 · 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

Citations17
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Wireless Network OptimizationFrench-language works237,207