{"id":"W1595627082","doi":"10.1007/978-3-642-02982-0_26","title":"Efficient Evaluation of Static and Dynamic Optimal Route Queries","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Graph; Shortest path problem; Dynamic problem; Enhanced Data Rates for GSM Evolution; Set (abstract data type); Algorithm; Path (computing); Dynamic programming; 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"],"consensus_categories":[],"category_scores_codex":[0.001743565,0.0003235126,0.0003675061,0.0006376031,0.0001184689,0.0003679623,0.001612026,0.0001030295,0.000008769954],"category_scores_gemma":[0.0000545221,0.0002923089,0.00005372465,0.0003940423,0.0005061019,0.000394763,0.0009820441,0.0002587947,0.000005825013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001853101,"about_ca_system_score_gemma":0.0003064341,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001011346,"about_ca_topic_score_gemma":0.00002120519,"domain_scores_codex":[0.9967703,0.00004243158,0.0004105425,0.0009849971,0.001434666,0.0003570939],"domain_scores_gemma":[0.9983334,0.0001483372,0.000274504,0.0008937598,0.0002714576,0.00007856355],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001942377,0.00001769099,0.000004687523,0.00002495948,0.000006890586,0.000008583086,0.0003751592,0.1424053,0.00002978059,0.008195241,0.00000282286,0.8489269],"study_design_scores_gemma":[0.0002485686,0.0001421947,0.0003895993,0.0001898661,0.00002251087,0.000009972213,3.110042e-7,0.9502895,0.00008922112,0.04821778,0.0001101975,0.0002902203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001210016,0.0004297643,0.9959666,0.0003889818,0.0005386288,0.0004384502,0.00001010258,0.00005641726,0.0009610556],"genre_scores_gemma":[0.283994,0.00005526104,0.7152387,0.0003477747,0.00007697185,0.000007149184,0.00001786669,0.00001768899,0.0002446046],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8486367,"threshold_uncertainty_score":0.9999529,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01677437801556516,"score_gpt":0.2665094323699007,"score_spread":0.2497350543543355,"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."}}