{"id":"W2765984063","doi":"10.1109/twc.2017.2762680","title":"Low-Complexity Priority-Aware Interference-Avoidance Scheduling for Multi-user Coexisting Wireless Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Guangxi Province; National Natural Science Foundation of China","keywords":"Computer science; Initialization; Scheduling (production processes); Greedy algorithm; Column generation; Mathematical optimization; Wireless network; Wireless; Linear programming; Maximization; Distributed computing; 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":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0002634498,0.0004681293,0.0004976659,0.0001624483,0.003222923,0.0003216625,0.002146614,0.0002883153,0.00001630685],"category_scores_gemma":[0.00002438302,0.0005648586,0.000213644,0.0002484181,0.0005453777,0.0007647922,0.00003101132,0.001079537,0.00001990184],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002900274,"about_ca_system_score_gemma":0.00005525179,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004695795,"about_ca_topic_score_gemma":0.001303329,"domain_scores_codex":[0.9979278,0.0001060869,0.0006780718,0.0004716637,0.0001912973,0.0006250134],"domain_scores_gemma":[0.9953049,0.0004557008,0.0003061793,0.003413672,0.0003337426,0.0001858171],"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.00003738828,0.0002382083,0.00007150796,0.0001125867,0.00008081526,7.548659e-7,0.0002573279,0.9408188,0.0006783321,0.001628196,0.00002673702,0.0560493],"study_design_scores_gemma":[0.001037919,0.0000353866,0.0002191427,0.0005283646,0.00005845297,0.000003703436,0.0001362181,0.9923464,0.004727206,0.00009814199,0.0002388888,0.0005701902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01740151,0.0001586784,0.9789981,0.0002175341,0.001032166,0.0009336783,0.0001475132,0.0009141052,0.0001967161],"genre_scores_gemma":[0.8952184,0.001443331,0.1021042,0.00004444137,0.0001093126,0.0006634752,0.00007029755,0.0001527818,0.0001937578],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8778169,"threshold_uncertainty_score":0.9996803,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07306982384635666,"score_gpt":0.3173709062947312,"score_spread":0.2443010824483746,"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."}}