{"id":"W2031878414","doi":"10.1109/iscc.2009.5202337","title":"An efficient scheduling scheme for MIMO wireless mesh networks with fairness constraints","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Wireless mesh network; Computer network; Wireless broadband; Maximum throughput scheduling; MIMO; Fairness measure; Scheduling (production processes); Distributed computing; Mesh networking; Max-min fairness; Wireless network; Broadband; Wireless; Broadband networks; Shared mesh; Switched mesh; Throughput; Dynamic priority scheduling; Round-robin scheduling; Mathematical optimization; Channel (broadcasting); Telecommunications; Quality of service; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002593432,0.0005766296,0.0007685525,0.0008110695,0.001546131,0.0008935959,0.001432059,0.0006692666,0.001253707],"category_scores_gemma":[0.003837477,0.0002403991,0.000474519,0.0008367283,0.0006528445,0.0009286591,0.0008627241,0.000652066,0.0002927741],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001532956,"about_ca_system_score_gemma":0.001699475,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00230943,"about_ca_topic_score_gemma":0.003459935,"domain_scores_codex":[0.9988695,0.0003399127,0.00008699523,0.0001480409,0.0003522037,0.0002032678],"domain_scores_gemma":[0.9981521,0.0007816721,0.000195396,0.0003024607,0.000408817,0.0001595313],"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.0008443863,0.0004148432,0.001843768,0.0002283151,0.000182246,0.000510079,0.0004769787,0.5038517,0.06950527,0.1383366,0.00625947,0.2775464],"study_design_scores_gemma":[0.00007834127,0.000208399,0.0003120809,0.000008633312,0.00004001547,0.0001540607,0.00003453559,0.9724769,0.007819601,0.01503336,0.003794984,0.00003901236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0250262,0.0003370657,0.9720305,0.0001544125,0.0002296616,0.0001644224,0.00006812398,0.0003491683,0.00164037],"genre_scores_gemma":[0.7729102,0.0002371379,0.2238122,0.0001520509,0.0002271616,0.0001947388,0.0001177938,0.00005080561,0.002297881],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002593432,"threshold_uncertainty_score":0.01371551,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01091670821275797,"score_gpt":0.2447810859494438,"score_spread":0.2338643777366858,"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."}}