{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001474118,0.0009908264,0.001236345,0.0003001221,0.0003776878,0.001079247,0.0009118015,0.0008178966,0.001919473],"category_scores_gemma":[0.003676821,0.000551019,0.000486449,0.0005176105,0.001164173,0.001027287,0.001106039,0.00126899,0.0001894069],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009470472,"about_ca_system_score_gemma":0.001661789,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004310435,"about_ca_topic_score_gemma":0.002594769,"domain_scores_codex":[0.9991366,0.0003309179,0.0000187163,0.0001200783,0.0001533281,0.0002404363],"domain_scores_gemma":[0.9983312,0.001208945,0.0001721297,0.00004162913,0.0001346753,0.0001114144],"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.0000733691,0.00003124214,0.0001310128,0.00002591607,0.00001147678,0.00003592936,0.00002473711,0.9891139,0.000833693,0.005430075,0.000289643,0.00399897],"study_design_scores_gemma":[0.000007389511,0.00002815345,0.00003635965,0.000001270499,0.000003537151,0.000006411785,0.000008867092,0.9980029,0.0002303034,0.00159597,0.0000759134,0.000002884082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05918714,0.0002921724,0.9370597,0.0002772899,0.0000594002,0.0000388905,0.00004883128,0.0001461831,0.002890341],"genre_scores_gemma":[0.9532272,0.0002405301,0.043587,0.00009547099,0.00004712771,0.00008210169,0.00006378459,0.00006954683,0.002587188],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004310435,"threshold_uncertainty_score":0.008570671,"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."}}