{"id":"W2996396392","doi":"10.1109/lcomm.2019.2959525","title":"Joint Channel Assignment and Occupancy Time Optimization in Frame-Based Listen-Before-Talk","year":2019,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Regina; Memorial University of Newfoundland; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Channel (broadcasting); Frame (networking); Optimization problem; Lyapunov optimization; Assignment problem; Mathematical optimization; Time complexity; Integer programming; Linear programming; Computer network; Network packet; Algorithm; Mathematics","routes":{"ca_aff":true,"ca_fund":true,"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":[],"consensus_categories":[],"category_scores_codex":[0.0003256101,0.0001380012,0.0001820983,0.0001465413,0.00012289,0.0001677485,0.001157239,0.00007062785,0.00001803937],"category_scores_gemma":[0.000008792189,0.000136332,0.0000436329,0.00034927,0.00007301776,0.0003286329,0.0002776438,0.0002318191,0.00005356239],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008305197,"about_ca_system_score_gemma":0.00003772979,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004511852,"about_ca_topic_score_gemma":0.00001269583,"domain_scores_codex":[0.9988594,0.0001941415,0.0002838724,0.0002704996,0.0001643416,0.0002277137],"domain_scores_gemma":[0.9977598,0.0001241777,0.0001325209,0.001885766,0.00003609158,0.00006170377],"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.00002680053,0.0004889726,0.006511807,0.00009291415,0.00004320889,0.000009130177,0.001705183,0.957558,0.008942363,0.003691376,0.004221655,0.01670855],"study_design_scores_gemma":[0.0005445586,0.00005721582,0.002617739,0.0001358232,0.000002859465,0.000002687094,0.000006945356,0.9946731,0.0002496918,0.0001358475,0.001397125,0.000176403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03350243,0.0001608243,0.9282849,0.03222769,0.0002027891,0.004621667,0.000005922453,0.0001795204,0.0008142846],"genre_scores_gemma":[0.9127529,0.00002470337,0.08090922,0.004792565,0.00003223338,0.001377125,0.0000236557,0.00001789759,0.00006964744],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8792505,"threshold_uncertainty_score":0.5559457,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02106664951619283,"score_gpt":0.2474728582202323,"score_spread":0.2264062087040395,"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."}}