{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009382059,0.001122531,0.001104803,0.001038051,0.0007019847,0.001269854,0.002102693,0.001818809,0.002540499],"category_scores_gemma":[0.005828621,0.00055277,0.0008876421,0.001043489,0.0009978956,0.00194339,0.001542333,0.001924907,0.0004607657],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001268136,"about_ca_system_score_gemma":0.001724958,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004993409,"about_ca_topic_score_gemma":0.004094649,"domain_scores_codex":[0.9992141,0.0001861856,0.00005511861,0.0002630106,0.0001862607,0.0000953351],"domain_scores_gemma":[0.9976816,0.001599754,0.0001733661,0.000164994,0.000297434,0.00008280817],"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.00003886647,0.00004600386,0.0004685995,0.00007574627,0.00003430899,0.00003494976,0.00007831598,0.9164891,0.0007479797,0.02606846,0.001034162,0.05488351],"study_design_scores_gemma":[0.000006557857,0.00001147499,0.00002468933,0.00000482132,0.000003347621,0.000009413714,0.000009399691,0.9879833,0.0001753056,0.01136198,0.0004057026,0.000003873071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008680427,0.00021596,0.9886118,0.0001987975,0.00004166695,0.00004424583,0.00004222781,0.0003763512,0.001788671],"genre_scores_gemma":[0.4893361,0.0005671738,0.5046515,0.0002331528,0.0001111236,0.000529384,0.000430487,0.0001896748,0.003951442],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004993409,"threshold_uncertainty_score":0.009928703,"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."}}