{"id":"W2156770151","doi":"10.1109/wcnc.2009.4917702","title":"Efficient Scheduling Algorithms for Multi-Service Multi-Slot OFDMA Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Scheduling (production processes); Quality of service; Distributed computing; Frequency-division multiple access; Algorithm; Limiting; Orthogonal frequency-division multiplexing; Computer network; Mathematical optimization; Engineering; Mathematics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001013335,0.0002427572,0.0002196548,0.00007145736,0.0001102262,0.00003756502,0.0001663161,0.000144728,0.00002052839],"category_scores_gemma":[0.00001735502,0.0002475863,0.00006827683,0.0003820323,0.00001013587,0.00008260268,0.00001974569,0.0001602208,0.00001311558],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007877048,"about_ca_system_score_gemma":0.000007559197,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004410951,"about_ca_topic_score_gemma":0.00001998142,"domain_scores_codex":[0.9988308,0.00001009633,0.0003010701,0.0002731102,0.0001090779,0.0004758625],"domain_scores_gemma":[0.999432,0.00005650774,0.00004350452,0.000225342,0.0001325457,0.0001101497],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000816764,0.00006467721,0.00001726465,0.00001915874,0.00001616112,7.893809e-7,0.00006107498,0.9666613,0.0005375175,0.0001757925,0.00004369503,0.03239442],"study_design_scores_gemma":[0.001217284,0.00002263804,0.0003181478,0.00004889761,0.00001658813,0.000001336048,0.00003655617,0.9970693,0.0007513593,0.000007457429,0.0001992988,0.0003111237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005997279,0.0008616001,0.9908615,0.00009728453,0.0004859226,0.0005539922,0.000005330846,0.001022904,0.0001141798],"genre_scores_gemma":[0.2935637,0.00009642156,0.7055441,0.0003072001,0.00024035,0.00006032629,0.00003212503,0.0000586455,0.00009711784],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2875664,"threshold_uncertainty_score":0.9999976,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03251393190186467,"score_gpt":0.277507513176932,"score_spread":0.2449935812750673,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}