{"id":"W2005223942","doi":"10.1109/mmit.2010.118","title":"Optimal Cooperative Multi-Source Multimedia Transmission Scheduling in Peer-to-Peer Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Communication source; Computer network; Scheduling (production processes); Peer-to-peer; Distributed computing; Scheme (mathematics); Key (lock); Transmission (telecommunications); Selection algorithm; Network congestion; Selection (genetic algorithm); Node (physics); File sharing; Multimedia; The Internet; Telecommunications; Mathematical optimization; Network packet; Computer security; World Wide Web","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.001522083,0.000621095,0.001011603,0.0006525966,0.0008528605,0.0006822997,0.001282765,0.0005423917,0.0004985912],"category_scores_gemma":[0.003109289,0.0004252418,0.0003074258,0.0006752363,0.0007033036,0.001157841,0.000729512,0.0004077311,0.0001261194],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001180097,"about_ca_system_score_gemma":0.001029734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003751603,"about_ca_topic_score_gemma":0.002925868,"domain_scores_codex":[0.9991564,0.0003437996,0.00003488926,0.0001517874,0.0002067015,0.0001064569],"domain_scores_gemma":[0.9983368,0.0009591616,0.0002290899,0.0001089048,0.0002514811,0.0001145258],"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.0002554361,0.00008391652,0.0004558372,0.00007260708,0.00003161712,0.0001332319,0.0001526959,0.945955,0.006877034,0.01208003,0.0006907043,0.03321184],"study_design_scores_gemma":[0.00001253684,0.00004014831,0.00007533985,0.000001702736,0.000006294787,0.00001629673,0.0000198629,0.9958824,0.0008472308,0.002927468,0.0001657402,0.000005039764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1594588,0.0007216822,0.8369095,0.000199003,0.00005913847,0.00007656847,0.00003180524,0.0002484948,0.002294871],"genre_scores_gemma":[0.9593141,0.0002162043,0.03962298,0.00002792476,0.00002823349,0.00004684838,0.0000213422,0.0000228837,0.0006994433],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003751603,"threshold_uncertainty_score":0.008562267,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01628630912161403,"score_gpt":0.2716703626283741,"score_spread":0.25538405350676,"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."}}