{"id":"W2054518948","doi":"10.1109/wcnc.2013.6554786","title":"Channel allocation and time scheduling in multi-channel wireless networks using network coding","year":2013,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Linear network coding; Computer network; Maximum throughput scheduling; Relay; Wireless network; Scheduling (production processes); Node (physics); Channel (broadcasting); Throughput; Network topology; Wireless; Distributed computing; Quality of service; Dynamic priority scheduling; Network packet; Round-robin scheduling; Mathematical optimization; Engineering; Telecommunications; 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.001475738,0.0004922032,0.0004851074,0.0005164354,0.0005245628,0.0006816864,0.0006369298,0.0005718232,0.0005546041],"category_scores_gemma":[0.003862881,0.0002704823,0.0003052034,0.001109606,0.001171896,0.001256473,0.0007355472,0.0005778535,0.00008500626],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001159178,"about_ca_system_score_gemma":0.001782618,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005021759,"about_ca_topic_score_gemma":0.00567939,"domain_scores_codex":[0.9990641,0.0004821287,0.0000309684,0.00007937948,0.0002109768,0.0001324459],"domain_scores_gemma":[0.9976998,0.001666017,0.0002206982,0.0001661236,0.0001896717,0.00005756054],"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.0000601959,0.00002289562,0.0002413323,0.00003471682,0.00001104056,0.00003969515,0.00005014474,0.9520685,0.002034683,0.02548706,0.0002362377,0.01971353],"study_design_scores_gemma":[0.000009767507,0.00002072334,0.00004580055,0.000003725268,0.000004600403,0.00001415258,0.00001071528,0.9901651,0.0007853523,0.00869419,0.0002408604,0.000005028102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03863354,0.0004635063,0.9586335,0.0001614806,0.00003134256,0.0000519638,0.00001975081,0.00007972735,0.001925153],"genre_scores_gemma":[0.8637196,0.0006073447,0.1342347,0.0000565298,0.00004738275,0.0001496035,0.00003628643,0.00002306706,0.001125469],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005021759,"threshold_uncertainty_score":0.00998503,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05684921789111879,"score_gpt":0.2770089840143359,"score_spread":0.2201597661232171,"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."}}