{"id":"W2133845767","doi":"10.1109/wiopt.2011.5930037","title":"Joint routing, scheduling, and network coding for wireless multihop networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Linear network coding; Computer science; Maximum throughput scheduling; Unicast; Computer network; Scheduling (production processes); Wireless network; Signal-to-interference-plus-noise ratio; Distributed computing; Wireless mesh network; Wireless; Coding (social sciences); Throughput; Mathematical optimization; Dynamic priority scheduling; Round-robin scheduling; Multicast; Mathematics; Telecommunications; Quality of service","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.001853503,0.0006741436,0.000523078,0.0005120058,0.0004015398,0.0009140848,0.0006393276,0.0004878457,0.0009769817],"category_scores_gemma":[0.00644546,0.0003051708,0.0003679935,0.001092672,0.001180222,0.002057435,0.0007353724,0.000759957,0.0001383077],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001220118,"about_ca_system_score_gemma":0.000891774,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001387198,"about_ca_topic_score_gemma":0.001510869,"domain_scores_codex":[0.9992154,0.0003937962,0.0000210555,0.00005182061,0.0002263107,0.00009161866],"domain_scores_gemma":[0.9973569,0.00211229,0.0001632974,0.0001777653,0.0001533456,0.00003640968],"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.00003810458,0.00002377929,0.0002560382,0.00005862217,0.00001701015,0.00004247939,0.0000423712,0.7933381,0.001435079,0.1911483,0.0006273504,0.01297269],"study_design_scores_gemma":[0.000004495016,0.00002267714,0.0000613907,0.000005898267,0.000004591937,0.00001742483,0.00001002822,0.953737,0.0005430343,0.04511658,0.0004730791,0.000003833974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03524366,0.001122865,0.9572551,0.0002572087,0.00003568428,0.00002994424,0.0000389534,0.00007072748,0.005945893],"genre_scores_gemma":[0.909438,0.001665108,0.08631296,0.00006359711,0.00009904482,0.0001047473,0.00005944671,0.00005497324,0.002201977],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001853503,"threshold_uncertainty_score":0.009802341,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08204351785227845,"score_gpt":0.2750651369714942,"score_spread":0.1930216191192158,"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."}}