{"id":"W2035420994","doi":"10.1109/aspdac.2015.7058980","title":"A novel approach using a minimum cost maximum flow algorithm for fault-tolerant topology reconfiguration in NoC architectures","year":2015,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Control reconfiguration; Spare part; Computer science; Network topology; Topology (electrical circuits); Fault tolerance; Maximum flow problem; Logical topology; Minimum-cost flow problem; Network on a chip; Distributed computing; Flow network; Algorithm; Embedded system; Computer network; Mathematical optimization; Engineering; Mathematics","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.0006904336,0.0001424594,0.0002401075,0.0002166568,0.00006709921,0.0001347439,0.0003495304,0.0001059981,0.000004520104],"category_scores_gemma":[0.00004755004,0.0001189794,0.00006063938,0.0002926962,0.00001849534,0.0001206452,0.00006649708,0.0001038194,0.000007202957],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001038963,"about_ca_system_score_gemma":0.000090459,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004634093,"about_ca_topic_score_gemma":0.0003862074,"domain_scores_codex":[0.9986653,0.00008472595,0.0003553432,0.0004197283,0.0001414976,0.0003333992],"domain_scores_gemma":[0.9992838,0.00008738443,0.00007042267,0.0002782969,0.0001514265,0.0001286858],"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.00007960309,0.0002757134,0.00003279383,0.00002741345,0.00003547786,0.000007682752,0.009045478,0.4112041,0.002148886,0.008126999,0.003285245,0.5657306],"study_design_scores_gemma":[0.0007867693,0.0001313514,0.00001243803,0.00001688953,0.00000190718,0.0001608878,0.0003293648,0.99414,0.0002905009,0.0008477471,0.003115521,0.0001666011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003908893,0.00001698623,0.9911578,0.0005505359,0.001353641,0.0008267016,0.000006078455,0.00006674087,0.002112641],"genre_scores_gemma":[0.2136194,1.882998e-7,0.784732,0.0007976808,0.0003326019,0.0001562175,0.000007065411,0.00001171439,0.000343173],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5829359,"threshold_uncertainty_score":0.4851839,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06941511974427564,"score_gpt":0.2886170239665886,"score_spread":0.219201904222313,"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."}}