{"id":"W1969776874","doi":"10.1109/sahcnw.2009.5172926","title":"Decoupled optimization of interference aware routing and scheduling for throughput maximization in wireless relay mesh networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Computer science; Scheduling (production processes); Time division multiple access; Wireless mesh network; Relay; Column generation; Wireless; Schedule; Wireless network; Distributed computing; Engineering; Mathematical optimization","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.001232171,0.0008387356,0.000683265,0.0004215763,0.0003145852,0.0006891451,0.0007235935,0.0005126802,0.001064847],"category_scores_gemma":[0.002215872,0.0005223363,0.0004466769,0.0008266179,0.000648031,0.0009915257,0.0006714455,0.0006904296,0.0001509066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001255859,"about_ca_system_score_gemma":0.001290369,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002140517,"about_ca_topic_score_gemma":0.002604489,"domain_scores_codex":[0.9992854,0.0003717039,0.00001992765,0.00007206991,0.0001502441,0.0001007862],"domain_scores_gemma":[0.9991971,0.0005374723,0.0001096964,0.00005487505,0.00006950855,0.00003128326],"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.00003970904,0.00002941698,0.0001050097,0.00003062735,0.00001359731,0.00002373234,0.00002148318,0.9807261,0.002636081,0.007590014,0.0003273626,0.008456853],"study_design_scores_gemma":[0.000007237907,0.00002105806,0.00004497439,0.000001573653,0.00000425325,0.000004632366,0.00000657217,0.9959621,0.0005912128,0.003200264,0.0001537974,0.000002385575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06364516,0.0003379528,0.9318091,0.0002772286,0.00003075855,0.00004395698,0.00007374865,0.0001650269,0.00361696],"genre_scores_gemma":[0.8865505,0.0004541867,0.1099142,0.00007447327,0.00005717757,0.00012343,0.000104953,0.00008956809,0.002631439],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002140517,"threshold_uncertainty_score":0.009111881,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03063396719881929,"score_gpt":0.2832843870232371,"score_spread":0.2526504198244178,"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."}}