{"id":"W4242395338","doi":"10.1109/icppw.2004.1328030","title":"Constrained cost minimization for multipoint communication groups","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Minification; Span (engineering); Routing (electronic design automation); Range (aeronautics); Distributed computing; Quality of service; Path (computing); 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009826401,0.0008422718,0.0005959672,0.0006488517,0.0004162688,0.0007035077,0.0008956664,0.0009114488,0.002113705],"category_scores_gemma":[0.002568822,0.0002857957,0.0004674742,0.0009315964,0.0007467986,0.001689651,0.001222414,0.0007510493,0.0002252632],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001186535,"about_ca_system_score_gemma":0.0007563409,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002269851,"about_ca_topic_score_gemma":0.001490883,"domain_scores_codex":[0.9992871,0.0002809107,0.00001933413,0.00009368105,0.0002450184,0.00007405037],"domain_scores_gemma":[0.9993056,0.0004180368,0.00007114279,0.00005678719,0.0001015177,0.00004696765],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003770013,0.00003012224,0.0001810236,0.00004964803,0.00001752807,0.00003484551,0.00004541202,0.9269745,0.0009620461,0.04736246,0.001087903,0.02321678],"study_design_scores_gemma":[0.000008147985,0.00002866795,0.00007473422,0.000005002089,0.000004637148,0.00001362188,0.00001427418,0.9724027,0.0003760535,0.02627275,0.0007955133,0.000003939778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.027943,0.0004135027,0.9676046,0.0003617961,0.00002825681,0.00004513161,0.00004240515,0.0000651991,0.003496153],"genre_scores_gemma":[0.7644461,0.0006719439,0.2260983,0.0001069595,0.00007642753,0.0003276296,0.0001485396,0.0001197034,0.008004365],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002269851,"threshold_uncertainty_score":0.008608937,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0152147214526496,"score_gpt":0.242980700357911,"score_spread":0.2277659789052614,"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."}}