{"id":"W2148378726","doi":"10.1109/ccece.1998.685549","title":"MINDEC: a routing algorithm for distributed communication networks with multiservice flows","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université TÉLUQ","funders":"","keywords":"Heuristics; Computer science; Distributed computing; Routing (electronic design automation); Network routing; Static routing; Distributed algorithm; Routing algorithm; Link-state routing protocol; Conjunction (astronomy); Destination-Sequenced Distance Vector routing; Computer network; Algorithm; Routing protocol","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.0002673134,0.0001200439,0.0001482139,0.00003129587,0.0002789705,0.0002308484,0.0006046535,0.00007261847,0.00003000557],"category_scores_gemma":[0.000007876996,0.00009285519,0.00005328054,0.0003010168,0.00001236856,0.0003348149,0.0001027224,0.0001077173,0.00001431726],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004028487,"about_ca_system_score_gemma":0.000005348107,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001333203,"about_ca_topic_score_gemma":0.000312722,"domain_scores_codex":[0.999043,0.00006803169,0.0002443936,0.000257543,0.0001196326,0.0002673794],"domain_scores_gemma":[0.9988517,0.0001858525,0.0001068402,0.0005980549,0.0001918888,0.00006571627],"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.00001502486,0.000264975,0.0004158306,0.00002289198,0.000139574,0.000007462931,0.002011701,0.09518638,0.00001658963,0.02629307,0.02388124,0.8517452],"study_design_scores_gemma":[0.0005361135,0.00006560484,0.0000669572,0.00004125917,0.000004715368,0.00002530894,0.00008773583,0.9913059,0.0000177012,0.00003560652,0.007668694,0.0001444224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0003761582,0.0001270332,0.9969528,0.0005509715,0.0002401366,0.0003399416,0.000004037865,0.0001966922,0.001212267],"genre_scores_gemma":[0.6942731,0.000009771371,0.3044258,0.0003370461,0.0001379629,0.00009345145,0.00002395982,0.00001079874,0.0006880927],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8961195,"threshold_uncertainty_score":0.3786525,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01920642592976632,"score_gpt":0.221518346985427,"score_spread":0.2023119210556607,"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."}}