{"id":"W1965556172","doi":"10.1109/icc.2010.5502758","title":"On Minimizing Broadcast Completion Delay for Instantly Decodable Network Coding","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":141,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Linear network coding; Greedy algorithm; Selection (genetic algorithm); Network packet; Computational complexity theory; Coding (social sciences); Selection algorithm; Algorithm; Mathematical optimization; Wireless network; Frame (networking); Wireless; Mathematics; Computer network; Artificial intelligence","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.002117332,0.0008924727,0.0009391369,0.0004816888,0.0004326071,0.0006646345,0.0008720323,0.0007262681,0.001005735],"category_scores_gemma":[0.00615119,0.0002806479,0.0002578862,0.0008246774,0.001295954,0.001303869,0.0008105422,0.0008189717,0.0001614506],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001750967,"about_ca_system_score_gemma":0.002294985,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002946045,"about_ca_topic_score_gemma":0.0024496,"domain_scores_codex":[0.999131,0.0003765527,0.00002371714,0.0001478388,0.0002058688,0.0001151179],"domain_scores_gemma":[0.9964924,0.00271765,0.0002517386,0.000174593,0.0002605317,0.0001030282],"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.0001093585,0.00004361666,0.0001669496,0.00005765196,0.00001595392,0.00002506783,0.00004663036,0.9522397,0.00319522,0.02816398,0.0006448089,0.01529109],"study_design_scores_gemma":[0.00001888357,0.00005650117,0.00007124689,0.000004423105,0.000004554917,0.00001154432,0.00001296064,0.9886286,0.001080074,0.009883231,0.0002223729,0.000005490267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04250204,0.0003258493,0.9553478,0.0002369065,0.00002751207,0.00004908435,0.000044261,0.0001167056,0.001349817],"genre_scores_gemma":[0.8395554,0.0006997238,0.1565513,0.0001097277,0.00007982181,0.0002166215,0.0001320728,0.0001029342,0.002552398],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002946045,"threshold_uncertainty_score":0.01270419,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04145693096827495,"score_gpt":0.290546781536613,"score_spread":0.249089850568338,"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."}}