{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003699267,0.00009620532,0.0001623328,0.00008248997,0.0001076923,0.00008583915,0.0003532821,0.0000579993,0.000005536948],"category_scores_gemma":[0.00006993202,0.000093131,0.00002337592,0.0004340552,0.00001984961,0.0004440348,0.0001383642,0.00009596518,1.507359e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003098938,"about_ca_system_score_gemma":0.00002793102,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003433631,"about_ca_topic_score_gemma":0.0000420408,"domain_scores_codex":[0.9991622,0.00006494238,0.0003226582,0.0002328568,0.00006664555,0.0001507144],"domain_scores_gemma":[0.9992308,0.000159829,0.0001266665,0.0002780936,0.0001737383,0.00003086132],"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.00001433289,0.00003900848,0.001448971,0.000007594394,0.000004730385,2.403422e-7,0.0006939884,0.7818202,0.0001817065,0.1336045,0.00001441063,0.08217037],"study_design_scores_gemma":[0.0003993932,0.00005888328,0.000876182,0.0001296134,0.000002297544,0.000001260606,0.00004569755,0.9978225,0.0003292407,0.0002286651,0.000002955959,0.0001032624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01280698,0.0001360634,0.9859046,0.0005888239,0.00005585357,0.0002324629,1.920457e-7,0.00005898746,0.0002159855],"genre_scores_gemma":[0.8130026,0.0007613739,0.1860192,0.0001666053,0.00001345409,0.000007704268,0.000006612769,0.000003985532,0.00001844319],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8001956,"threshold_uncertainty_score":0.3797772,"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."}}