{"id":"W1887859263","doi":"10.1109/dftvs.1992.224357","title":"Nondeterministic adaptive routing techniques for WSI processor arrays","year":2003,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Nondeterministic algorithm; Computer science; Hypercube; Adaptive routing; Routing (electronic design automation); Distance-vector routing protocol; Parallel computing; Equal-cost multi-path routing; Network packet; Distributed computing; Static routing; Routing algorithm; Network topology; Multipath routing; Destination-Sequenced Distance Vector routing; Dynamic Source Routing; Algorithm; Computer network; 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.000404071,0.0001030499,0.0001351861,0.00004759078,0.0001456084,0.0001362989,0.0002883576,0.00005520609,0.00001148056],"category_scores_gemma":[0.0000826496,0.0000827275,0.00006312838,0.00015088,0.00001383713,0.0002262037,0.00002695606,0.0000593525,0.00001197606],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003040007,"about_ca_system_score_gemma":0.00004844986,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006739939,"about_ca_topic_score_gemma":0.000009725676,"domain_scores_codex":[0.9991241,0.0000395005,0.0002168647,0.0002859644,0.00009938823,0.0002342026],"domain_scores_gemma":[0.9993769,0.0001191246,0.00008352577,0.0002258238,0.0001493629,0.00004525656],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005113356,0.0000307725,0.0000415459,0.00001969513,0.00001174788,0.000002696315,0.0004634237,0.00003404625,0.000365412,0.9849465,0.002388306,0.01169073],"study_design_scores_gemma":[0.000508623,0.0009823076,0.00001831204,0.0001681467,0.00001178426,0.0001574844,0.0005969545,0.8250185,0.066583,0.03410709,0.07113419,0.0007136096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000179758,0.00001049079,0.9303382,0.000070178,0.0003748423,0.0003366054,6.08508e-7,0.0002688192,0.06842047],"genre_scores_gemma":[0.8626736,5.622316e-7,0.1342597,0.0002539686,0.0001006624,0.0001382596,2.957878e-7,0.000007519643,0.002565438],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9508394,"threshold_uncertainty_score":0.337353,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02827791653895456,"score_gpt":0.2628577428532801,"score_spread":0.2345798263143255,"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."}}