{"id":"W2142295403","doi":"10.1109/pdcat.2007.67","title":"Two Tree-Based Algorithms for Network Spare Capacity Design","year":2007,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Spare part; Survivability; Backup; Computer science; Algorithm; Tree (set theory); Steiner tree problem; Mathematical optimization; Computer network; Mathematics; Engineering; Combinatorics; Database","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.000954784,0.0008669094,0.000589295,0.001362261,0.0004952342,0.0008241892,0.001373801,0.0009346441,0.0055097],"category_scores_gemma":[0.003660215,0.0003630906,0.0009077486,0.001562949,0.0005752062,0.001581742,0.001001681,0.001085308,0.0009478529],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00124383,"about_ca_system_score_gemma":0.001367151,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002266245,"about_ca_topic_score_gemma":0.003044287,"domain_scores_codex":[0.9991793,0.0002259575,0.00006122806,0.0001444079,0.0003047448,0.00008435279],"domain_scores_gemma":[0.9990037,0.0005003531,0.00005765161,0.0001295565,0.0002715584,0.00003727475],"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.0001582587,0.00009738495,0.0003497995,0.0001819111,0.00004725172,0.00004392666,0.0001346744,0.3759277,0.003542382,0.08368082,0.007274135,0.5285618],"study_design_scores_gemma":[0.00004986192,0.0000864817,0.00008497828,0.00001935759,0.00002008179,0.00007417956,0.00002032208,0.9524083,0.002841396,0.03452152,0.009856001,0.00001760736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001467284,0.000159651,0.9969395,0.00006584655,0.00003017353,0.00003647433,0.00003059735,0.0002194667,0.001051044],"genre_scores_gemma":[0.04772912,0.0003902809,0.9489825,0.00009487326,0.00004418888,0.000235353,0.0002052683,0.00009710237,0.002221399],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0055097,"threshold_uncertainty_score":0.01843178,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08022670335958362,"score_gpt":0.2858698216112084,"score_spread":0.2056431182516248,"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."}}