{"id":"W2150974686","doi":"10.1109/glocom.1991.188368","title":"A neural network shortest path algorithm for optimum routing in packet-switched communications networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Shortest path problem; Artificial neural network; Robustness (evolution); Network packet; Routing (electronic design automation); Computation; Path (computing); Algorithm; Computer network; Artificial intelligence; Theoretical computer science","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.0005590306,0.0005828781,0.000645385,0.0006053007,0.000430004,0.0006894135,0.0009134554,0.001158176,0.002596659],"category_scores_gemma":[0.00189179,0.0003101314,0.0003280112,0.0008245073,0.0004926687,0.001184313,0.0006738934,0.0009813476,0.0004413674],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008011467,"about_ca_system_score_gemma":0.001117923,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004448603,"about_ca_topic_score_gemma":0.00425764,"domain_scores_codex":[0.9997645,0.00006915299,0.00001441677,0.00003838888,0.0000905468,0.00002294853],"domain_scores_gemma":[0.9997134,0.0001536065,0.00002483795,0.00001627309,0.00007849451,0.00001344104],"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.00006602374,0.00002914417,0.0001936093,0.00006710506,0.00003023387,0.00003416093,0.00003313582,0.8313948,0.001639994,0.02514778,0.002645449,0.1387186],"study_design_scores_gemma":[0.000009973722,0.00001172335,0.00002492233,0.000004171709,0.00000353112,0.000009085907,0.000002777019,0.9931946,0.0002984598,0.005489776,0.0009478026,0.000003167625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003449452,0.0003416518,0.9940958,0.0001833055,0.00005323543,0.00003034406,0.00002430961,0.0002228258,0.001599032],"genre_scores_gemma":[0.1739263,0.000857942,0.8186912,0.0001480169,0.00009618996,0.0002834286,0.0001482438,0.00009534334,0.00575337],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004448603,"threshold_uncertainty_score":0.008845389,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03249872416982492,"score_gpt":0.2580709072216661,"score_spread":0.2255721830518412,"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."}}