{"id":"W4243435461","doi":"10.1109/pdcat.2007.4420181","title":"Two Tree-Based Algorithms for Network Spare Capacity Design","year":2007,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Spare part; Computer science; Tree (set theory); Algorithm design; Algorithm; Engineering; Mathematics; Operations management","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.0009940668,0.0008550899,0.0005906133,0.001382379,0.0004933971,0.0008315453,0.001368964,0.0009321536,0.005518962],"category_scores_gemma":[0.003787906,0.0003618751,0.0008902017,0.001540134,0.0005900934,0.001583398,0.00101957,0.001085643,0.0009084061],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001272771,"about_ca_system_score_gemma":0.001389826,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002270814,"about_ca_topic_score_gemma":0.003069663,"domain_scores_codex":[0.9991671,0.0002285779,0.00006274106,0.0001460922,0.0003087508,0.00008670669],"domain_scores_gemma":[0.9989768,0.0005161037,0.00006036444,0.0001330846,0.0002747457,0.00003893788],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000161718,0.00009959282,0.0003633357,0.0001791827,0.00004682901,0.00004337747,0.0001369037,0.3780653,0.003550142,0.08482114,0.00698583,0.5255467],"study_design_scores_gemma":[0.00005098704,0.00008554885,0.00008795599,0.00001943766,0.00001982279,0.00007343155,0.00002089971,0.9520803,0.002838035,0.0353323,0.009373347,0.00001804694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001529909,0.0001556049,0.9969065,0.00006602779,0.00002988999,0.00003679598,0.00003022554,0.0002152839,0.001029881],"genre_scores_gemma":[0.04897854,0.0003686767,0.9478485,0.00009222941,0.00004336421,0.0002272757,0.0001933817,0.0000941346,0.002153864],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005518962,"threshold_uncertainty_score":0.01846278,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05342208246726386,"score_gpt":0.2679088806525975,"score_spread":0.2144867981853336,"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."}}