{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006213837,0.0004383576,0.0004118487,0.0006842721,0.0005729808,0.0007929357,0.00101996,0.0005892509,0.002464344],"category_scores_gemma":[0.002072528,0.0002736358,0.0002973228,0.0006402596,0.0004090395,0.001342527,0.001331405,0.000875122,0.0005403401],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005991214,"about_ca_system_score_gemma":0.0009263239,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001485819,"about_ca_topic_score_gemma":0.00212548,"domain_scores_codex":[0.9997424,0.00006549227,0.00001616254,0.00004583303,0.00009348593,0.00003656913],"domain_scores_gemma":[0.9996473,0.0001443054,0.00003845113,0.00005772127,0.00008616609,0.00002601069],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003071264,0.00007774019,0.0009380947,0.0002075208,0.00004495731,0.000126801,0.0001659991,0.3500754,0.01025046,0.07465703,0.01002732,0.5531216],"study_design_scores_gemma":[0.00008644173,0.00007097224,0.0001755567,0.00002177245,0.00001585781,0.000166965,0.00003009989,0.9391963,0.005607381,0.03175279,0.02285457,0.00002125475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005369124,0.0001473103,0.991716,0.00008523448,0.00003945717,0.00005885233,0.00005773241,0.001142817,0.001383486],"genre_scores_gemma":[0.1048285,0.0002021648,0.8918287,0.00007689362,0.00002256292,0.0001349637,0.0002363443,0.0001712023,0.002498565],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002464344,"threshold_uncertainty_score":0.008244097,"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."}}