{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005382032,0.000175369,0.0002094699,0.0001097829,0.0003105321,0.0003203017,0.0005222152,0.00008897683,0.00002477073],"category_scores_gemma":[0.00002459542,0.0001729377,0.0000288931,0.0006572053,0.00004497565,0.0008360183,0.0005834805,0.0002353858,0.00002984219],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000624126,"about_ca_system_score_gemma":0.00002828781,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006581387,"about_ca_topic_score_gemma":0.00006693872,"domain_scores_codex":[0.9986255,0.0001724263,0.0003197305,0.0003665745,0.0001122842,0.0004034913],"domain_scores_gemma":[0.9990693,0.0001521819,0.00009728356,0.0004339999,0.0001375361,0.0001097373],"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.000003042978,0.00006642249,0.0005483539,0.000009176253,0.00001690649,0.000001997247,0.0009604395,0.9620589,0.001308689,0.01255284,0.0002005805,0.02227265],"study_design_scores_gemma":[0.0003352163,0.00001205359,0.001752735,0.0001206617,0.000002134173,0.000005912546,0.00004527827,0.9971225,0.00006545608,0.0003008624,0.00002051088,0.0002167001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04062613,0.0008598601,0.9569627,0.000673684,0.0001567475,0.0003309746,7.173833e-8,0.0001372302,0.0002525863],"genre_scores_gemma":[0.9585921,0.0006281045,0.03993056,0.0005503253,0.00009319399,0.0000301164,0.000003091219,0.00001391399,0.0001586007],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9179659,"threshold_uncertainty_score":0.7052194,"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."}}