{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001640336,0.0005550021,0.0004781017,0.0005978335,0.0008934499,0.001420291,0.00424821,0.000281514,0.00000698412],"category_scores_gemma":[0.0002820471,0.0004206226,0.0001816751,0.001395412,0.0008027834,0.0004820637,0.0008696707,0.001119447,0.00001452171],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001310561,"about_ca_system_score_gemma":0.004593493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001458378,"about_ca_topic_score_gemma":0.00003849635,"domain_scores_codex":[0.995472,0.00009698088,0.0005715118,0.001558972,0.001246756,0.001053808],"domain_scores_gemma":[0.9959772,0.001838446,0.0003489791,0.001207455,0.0004274267,0.0002004901],"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.000002401233,0.00005063347,0.000001348928,0.00003361596,0.000006151826,0.000005300944,0.0005464471,0.7150054,0.00001428551,0.0002638297,0.00002024271,0.2840503],"study_design_scores_gemma":[0.0005624471,0.0004696705,0.00001008064,0.0004528759,0.00001117357,0.00002598836,4.715567e-7,0.9824597,0.00004236773,0.01348378,0.001964769,0.0005167378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000001629268,0.0002739051,0.9946892,0.001932572,0.0008272458,0.001606072,0.000007149359,0.0004860285,0.000176167],"genre_scores_gemma":[0.02521547,0.000008662796,0.9710029,0.001415121,0.0002698019,0.0001596783,0.00004278598,0.0000772796,0.001808277],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2835336,"threshold_uncertainty_score":0.9998246,"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."}}