{"id":"W1594260854","doi":"10.1007/978-3-540-24677-0_26","title":"Stochastic Learning Automata-Based Dynamic Algorithms for the Single Source Shortest Path Problem","year":2004,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Shortest path problem; Computer science; Shortest Path Faster Algorithm; K shortest path routing; Yen's algorithm; Algorithm; Widest path problem; Floyd–Warshall algorithm; Learning automata; Graph; Euclidean shortest path; Constrained Shortest Path First; Automaton; Dijkstra's algorithm; Mathematical optimization; Theoretical computer science; Mathematics","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.00119352,0.001053311,0.0019345,0.001139956,0.0008883186,0.001533493,0.00282793,0.001814819,0.005030167],"category_scores_gemma":[0.006252185,0.0007799715,0.001062638,0.001731784,0.001558649,0.00262762,0.002132326,0.002939322,0.0007632658],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001907413,"about_ca_system_score_gemma":0.001985629,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008943189,"about_ca_topic_score_gemma":0.009102129,"domain_scores_codex":[0.9992381,0.0002214774,0.00005106972,0.0002037547,0.0001921204,0.00009343788],"domain_scores_gemma":[0.9960014,0.003121298,0.0001784568,0.0002092846,0.0003619488,0.0001276606],"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.00006298119,0.00004574692,0.0001885538,0.00006866948,0.00002691765,0.00001811524,0.00005050941,0.9107169,0.0003972676,0.04029357,0.001754237,0.04637651],"study_design_scores_gemma":[0.00001080883,0.000009199593,0.00001877598,0.000004639091,0.000004144388,0.000006297099,0.00000462818,0.9741395,0.00008693158,0.02540614,0.0003048263,0.000004165559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01412352,0.0005362633,0.9796193,0.0003459559,0.00009874822,0.0000567514,0.0001171275,0.0005342077,0.004568217],"genre_scores_gemma":[0.5124037,0.001203641,0.4745432,0.0002338078,0.0001719523,0.0005198743,0.0006325195,0.0003880208,0.009903135],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008943189,"threshold_uncertainty_score":0.01778227,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01792430491561916,"score_gpt":0.2598657693234213,"score_spread":0.2419414644078021,"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."}}