Fast optimal radio resource allocation in OFDMA system based on branch-and-bound method
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.
Bibliographic record
Abstract
Our attention in this paper is focused on radio resource allocation (RRA) problems in orthogonal frequency division multiple access (OFDMA) systems. By assuming perfect channel estimation for all users, a fast optimal algorithm is developed to solve two classes of RRA problems: one class is to minimize the total transmission power at base station under the quality of service (QoS) constraint of each user, and the other class is to achieve maximum system data throughput under the constraints of maximal transmission power at base station and QoS of each user. The proposed algorithm is developed on the basis of the well-known branch-and-bound method. As shown in our results, the proposed algorithm offers the same performance as the optimal one achieved by using exhaustive full-search algorithm. However, the computational complexity involved in the proposed algorithm is significantly reduced.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it