{"id":"W1572240008","doi":"10.1109/icppw.2004.35","title":"Constrained cost minimization for multipoint communication groups","year":2004,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Parallel Processing","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Minification; Span (engineering); Routing (electronic design automation); Distributed computing; Range (aeronautics); Path (computing); Quality of service; Mathematical optimization; Core (optical fiber); Computer network; Mathematics; Telecommunications; Engineering","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":[],"consensus_categories":[],"category_scores_codex":[0.0002633178,0.0001417643,0.0001486154,0.00007710756,0.0002137948,0.0002931978,0.00161796,0.00006252699,0.000007174282],"category_scores_gemma":[0.0001629111,0.0001120869,0.00008166401,0.0001694697,0.000123179,0.0005961273,0.0001495142,0.00013826,0.000003293458],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008744013,"about_ca_system_score_gemma":0.000169262,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004735801,"about_ca_topic_score_gemma":0.000004265957,"domain_scores_codex":[0.9988486,0.000006278851,0.0003414233,0.0002779886,0.0003576165,0.0001680588],"domain_scores_gemma":[0.9982855,0.00005610017,0.0004372531,0.0001414058,0.001034201,0.00004554068],"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.00008626055,0.0001054591,0.000110712,0.00003023885,0.00002360701,8.814315e-8,0.0005534829,0.005481913,0.00189562,0.9220199,0.0001880456,0.06950466],"study_design_scores_gemma":[0.002763325,0.00009867981,0.0003767417,0.0006329954,0.00001810272,0.0000140616,0.0003531119,0.8782299,0.003566054,0.1129457,0.0007449607,0.0002563993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02266933,0.00009170917,0.919745,0.0386262,0.000436747,0.001266496,0.000009993729,0.0002101977,0.01694426],"genre_scores_gemma":[0.9464017,0.0000225799,0.05269276,0.0005116895,0.00005550987,0.0001506223,0.000005263789,0.000008640421,0.0001512357],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9237323,"threshold_uncertainty_score":0.457077,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03771328992926238,"score_gpt":0.2766058736599391,"score_spread":0.2388925837306767,"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."}}