{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00119811,0.0004356562,0.000432096,0.000494018,0.0002017186,0.0003559125,0.00255396,0.0004445373,0.00006376969],"category_scores_gemma":[0.0007041103,0.0003800996,0.00009370209,0.001883463,0.0001113015,0.0005722253,0.0008761976,0.001387276,0.0002393888],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007437867,"about_ca_system_score_gemma":0.00009999848,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001342972,"about_ca_topic_score_gemma":0.0004197759,"domain_scores_codex":[0.9964473,0.00007979209,0.0005222579,0.001096029,0.0008266961,0.001027979],"domain_scores_gemma":[0.9975482,0.0002729099,0.00007031048,0.00108304,0.0005536557,0.0004718518],"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.00003054406,0.0001967335,0.001163454,0.000004394915,0.00002088012,0.00004918148,0.002556863,0.7693615,0.01048155,0.001279235,0.004809834,0.2100458],"study_design_scores_gemma":[0.0007894911,0.0001246597,0.002515745,0.00004510564,0.000003992048,0.00001576474,0.000159246,0.9661027,0.009652877,0.00003146405,0.02001668,0.0005423421],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1377676,0.00003691947,0.8450765,0.01430294,0.000657668,0.0006022118,0.000001636247,0.001170944,0.0003835742],"genre_scores_gemma":[0.4278352,0.000002445696,0.5688458,0.0007387032,0.00009177715,0.00005621251,0.000004629801,0.00002472079,0.002400478],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2900676,"threshold_uncertainty_score":0.9998651,"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."}}