{"id":"W2546190674","doi":"10.1109/glocom.2016.7842079","title":"Optimal Control for Network Coding Broadcast","year":2016,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Linear network coding; Multicast; Markov decision process; Computer network; Network packet; Coding (social sciences); Intuition; Computational complexity theory; Markov process; Distributed computing; Scheduling (production processes); Algorithm; 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.001927568,0.001011038,0.0009762885,0.0006906603,0.0005627678,0.001189607,0.0008637971,0.0008538467,0.002736984],"category_scores_gemma":[0.006544359,0.0003896122,0.0003364666,0.0006812938,0.001906785,0.0009525251,0.001237619,0.001404798,0.0002472381],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00372673,"about_ca_system_score_gemma":0.002193459,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01399219,"about_ca_topic_score_gemma":0.007476334,"domain_scores_codex":[0.9987601,0.0004229074,0.00003629937,0.0002221232,0.0002483689,0.0003102061],"domain_scores_gemma":[0.9950539,0.003742086,0.000467082,0.000121834,0.0004636417,0.0001513364],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001326698,0.00003932938,0.0001672745,0.00005960625,0.00001575503,0.00004194255,0.00006328029,0.9385452,0.001355763,0.05184942,0.001091046,0.006638641],"study_design_scores_gemma":[0.00001900969,0.00001680429,0.00004232263,0.000004560903,0.000003024049,0.000003877165,0.0000075731,0.9891521,0.0001977963,0.01034355,0.0002047513,0.000004652469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06629357,0.000575147,0.9121664,0.001064362,0.0001448331,0.0001158089,0.0001725621,0.0003270255,0.0191403],"genre_scores_gemma":[0.9726351,0.0002753178,0.0215365,0.0001264375,0.00005382867,0.0001512446,0.00007409867,0.0000414255,0.005106045],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01399219,"threshold_uncertainty_score":0.02782148,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03744334014911874,"score_gpt":0.2789508655703171,"score_spread":0.2415075254211983,"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."}}