{"id":"W2152324445","doi":"10.1109/tsmcb.2005.850180","title":"Dynamic Algorithms for the Shortest Path Routing Problem: Learning Automata-Based Solutions","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Shortest path problem; Shortest Path Faster Algorithm; K shortest path routing; Algorithm; Widest path problem; Computer science; Yen's algorithm; Euclidean shortest path; Distance; Graph; Mathematics; Dijkstra's algorithm; 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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009942668,0.0003914052,0.0003496221,0.0002001723,0.001257039,0.0007663502,0.0006904382,0.000185667,0.00002270246],"category_scores_gemma":[0.00001605363,0.0003294039,0.0001785277,0.0004413368,0.000189016,0.00026146,0.00001705631,0.0005415701,0.00007314231],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001379829,"about_ca_system_score_gemma":0.0001451658,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009389623,"about_ca_topic_score_gemma":0.0001649557,"domain_scores_codex":[0.996927,0.000241257,0.0007151767,0.0007278298,0.0005831645,0.0008055462],"domain_scores_gemma":[0.9979375,0.0005849614,0.0002267194,0.0007168511,0.0002591727,0.0002747797],"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.00001038156,0.0002466236,0.00001854519,0.00004176693,0.00007594621,0.000002212412,0.0007938003,0.9468598,0.0000762245,0.006340145,0.0005665994,0.04496794],"study_design_scores_gemma":[0.0009568647,0.0003146413,0.00006465962,0.0001440683,0.0000665907,0.00002807079,0.0001679382,0.9620799,0.0001346667,0.00008195361,0.03557093,0.0003897094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0003394617,0.0004122696,0.9933977,0.002146686,0.0006557608,0.001459198,0.00004239502,0.0004791051,0.001067416],"genre_scores_gemma":[0.9628459,0.0003832794,0.02948553,0.0002507862,0.0001115574,0.0005311331,0.00001492555,0.00006299873,0.006313903],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9639122,"threshold_uncertainty_score":0.9999158,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03107009743229232,"score_gpt":0.2632003485274709,"score_spread":0.2321302510951786,"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."}}