{"id":"W2110098267","doi":"10.1109/tr.2005.853440","title":"Reliability Optimization of Distributed Access Networks With Constrained Total Cost","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Reliability","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical optimization; Reliability (semiconductor); Constraint (computer-aided design); Upper and lower bounds; Computer science; Tree (set theory); Branch and bound; Process (computing); Optimization problem; Combinatorial optimization; Reliability theory; Search tree; Mathematics; Search algorithm; Reliability engineering; Engineering; Failure rate","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.001091969,0.001018268,0.001041735,0.0006869782,0.000315316,0.0008202924,0.0007299828,0.0005825576,0.001218295],"category_scores_gemma":[0.003190585,0.0004136626,0.0004856724,0.001024028,0.0006161084,0.001137064,0.0006770171,0.0006037289,0.0001448371],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009270581,"about_ca_system_score_gemma":0.0008455951,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00269528,"about_ca_topic_score_gemma":0.001700037,"domain_scores_codex":[0.999218,0.0003223039,0.00002594154,0.0001073705,0.0002245611,0.000101874],"domain_scores_gemma":[0.99848,0.001052731,0.0001459573,0.0000563905,0.0002228948,0.0000420329],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002666984,0.00001268812,0.0001806318,0.00004790258,0.00001643138,0.00004448444,0.00001815895,0.9830661,0.0009545932,0.008113896,0.0002248984,0.007293545],"study_design_scores_gemma":[0.000008560468,0.00002531492,0.00009435083,0.000003648985,0.000007419809,0.0000172395,0.000008154034,0.9941297,0.0003029125,0.005144419,0.0002554689,0.0000029678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0939682,0.001100775,0.8991303,0.0003207157,0.00003936919,0.00004859666,0.0000925496,0.0001653243,0.005134219],"genre_scores_gemma":[0.9326807,0.0008630345,0.06241635,0.00004795111,0.00005082472,0.0001507815,0.0001341583,0.00009217951,0.003563875],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00269528,"threshold_uncertainty_score":0.006726325,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007269141267441066,"score_gpt":0.2175768517132472,"score_spread":0.2103077104458061,"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."}}