{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005096904,0.0006734693,0.0006837262,0.0002932104,0.0004568865,0.0005174251,0.0007985766,0.0003928789,0.001279656],"category_scores_gemma":[0.001186608,0.000313409,0.0003315083,0.0005169107,0.0003286842,0.0006317063,0.0005570018,0.0007545254,0.00017412],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005691718,"about_ca_system_score_gemma":0.001384473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004225247,"about_ca_topic_score_gemma":0.005583872,"domain_scores_codex":[0.9996789,0.0001042908,0.0000101417,0.00003762438,0.0001023216,0.00006670915],"domain_scores_gemma":[0.9994642,0.0003445151,0.00005516902,0.00003497965,0.00006647701,0.0000346067],"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.00009690109,0.00008043747,0.0003934049,0.00008196218,0.00001832374,0.00007041097,0.00004475261,0.9379982,0.004540394,0.008844048,0.0007511541,0.04707995],"study_design_scores_gemma":[0.000004586941,0.0000127313,0.00002187784,7.422466e-7,0.000001479361,0.000005359452,0.000002990769,0.9988776,0.000226489,0.0007738786,0.00007122708,0.000001047474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02940203,0.0002411016,0.9683156,0.00009668999,0.00003604863,0.00003512469,0.00002002312,0.0001799272,0.00167354],"genre_scores_gemma":[0.7973333,0.0002353867,0.2007559,0.00006623325,0.00005688726,0.00008706345,0.00007133601,0.00004553581,0.001348412],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004225247,"threshold_uncertainty_score":0.008401334,"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."}}