{"id":"W2123408601","doi":"10.1109/wcnc.2011.5779282","title":"Scheduling and network coding in wireless multicast networks: A case for unequal time shares","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Linear network coding; Wireless network; Computer network; Multicast; Scheduling (production processes); Wireless; Distributed computing; Maximum throughput scheduling; Round-robin scheduling; Fair-share scheduling; Mathematical optimization; 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.003372333,0.0006095649,0.0007454501,0.0005397432,0.0009203465,0.0009826013,0.00100413,0.001311831,0.001379969],"category_scores_gemma":[0.01830238,0.0004220196,0.0004872176,0.001082355,0.00262926,0.003314048,0.00163066,0.001210787,0.0001374925],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001555404,"about_ca_system_score_gemma":0.001010207,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001676143,"about_ca_topic_score_gemma":0.001224572,"domain_scores_codex":[0.9976635,0.001030463,0.00007216074,0.000195959,0.0006004664,0.000437425],"domain_scores_gemma":[0.9894986,0.007936926,0.001087534,0.0007746076,0.0004550143,0.0002473226],"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.0001521135,0.00003803203,0.0007002528,0.0000417842,0.00001793404,0.0003129352,0.0002387362,0.7523504,0.00302058,0.2325252,0.0003449328,0.0102572],"study_design_scores_gemma":[0.00003267159,0.00005386932,0.0001842745,0.00001115358,0.0000102661,0.0001099659,0.00008813064,0.9107924,0.001831182,0.08608317,0.0007907386,0.00001218153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1844193,0.0003600919,0.8076528,0.0009351924,0.00004439563,0.000050706,0.00004755145,0.00004889653,0.006441023],"genre_scores_gemma":[0.9532778,0.0002257119,0.04450947,0.00009409934,0.00006563269,0.0001061836,0.00001948662,0.00003416337,0.001667404],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003372333,"threshold_uncertainty_score":0.01783478,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07352614722334168,"score_gpt":0.2874364974046459,"score_spread":0.2139103501813043,"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."}}