{"id":"W1999423211","doi":"10.1109/iwcmc.2012.6314312","title":"On-demand scheduling for concurrent multipath transfer under delay-based disparity","year":2012,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"Western University","funders":"University of Toronto; Princeton University","keywords":"Computer science; Scheduling (production processes); Distributed computing; Multipath propagation; Network congestion; Computer network; Fair-share scheduling; Data transmission; Dynamic priority scheduling; Round-robin scheduling; Job shop scheduling; Real-time computing; Mathematical optimization","routes":{"ca_aff":true,"ca_fund":true,"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":[],"consensus_categories":[],"category_scores_codex":[0.0003355481,0.0001452869,0.0001535344,0.00003840164,0.0001391879,0.00007135607,0.000296362,0.00006501031,0.00003768095],"category_scores_gemma":[0.00001754399,0.0001149351,0.0001093781,0.00009809689,0.00002970356,0.0002321646,0.00001748947,0.0001093991,0.0000408118],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000265527,"about_ca_system_score_gemma":0.00005333211,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000312042,"about_ca_topic_score_gemma":0.000008858865,"domain_scores_codex":[0.9989313,0.00004724327,0.0001776597,0.0002575672,0.0001730399,0.0004131212],"domain_scores_gemma":[0.9990432,0.0004280671,0.0000204517,0.0002526155,0.0000605651,0.000195135],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002795189,0.0002792201,0.0004995819,0.00001311537,0.00002525065,4.984291e-7,0.00009180647,0.03052577,0.00003332444,0.8546527,0.0006228012,0.113228],"study_design_scores_gemma":[0.00179266,0.00008590257,0.0005182273,0.00001837621,0.00001563202,0.00000114364,0.000008003765,0.9942418,0.0002655891,0.0007496512,0.002101331,0.0002017273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02768332,0.0002609729,0.9692154,0.001066474,0.000917415,0.0003334201,0.000003688135,0.0001908182,0.0003284772],"genre_scores_gemma":[0.9778502,0.000002848993,0.01981002,0.001978685,0.0001712489,0.00007918529,0.000003913458,0.000008363089,0.00009553685],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.963716,"threshold_uncertainty_score":0.4686916,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02803234572313531,"score_gpt":0.267013599271884,"score_spread":0.2389812535487487,"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."}}