{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002037821,0.001241474,0.002176739,0.00137103,0.0008219449,0.003556209,0.002645458,0.001113944,0.008590837],"category_scores_gemma":[0.009171225,0.0006583271,0.0006693887,0.002019015,0.000854861,0.003783637,0.001812027,0.0008136236,0.001683916],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002313362,"about_ca_system_score_gemma":0.002380966,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00889954,"about_ca_topic_score_gemma":0.01137097,"domain_scores_codex":[0.9954345,0.0008657705,0.0002491698,0.000527062,0.002304502,0.0006190003],"domain_scores_gemma":[0.9946105,0.003101874,0.0002002794,0.0008627092,0.00101028,0.0002143614],"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.005796369,0.0004815132,0.005336454,0.0005632228,0.0001945786,0.0003464775,0.0003822033,0.2171697,0.03749603,0.02982139,0.02905432,0.6733577],"study_design_scores_gemma":[0.0001444235,0.0001552779,0.0009787752,0.00001383485,0.00005320409,0.0001336229,0.0001455587,0.972705,0.01282964,0.009705422,0.00311059,0.00002471873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2813674,0.003487812,0.6650721,0.0008246684,0.0003438449,0.0004273187,0.001800749,0.02088049,0.02579558],"genre_scores_gemma":[0.765882,0.0004819513,0.2223136,0.0001231885,0.0001284726,0.0001176211,0.002287071,0.001131694,0.007534412],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00889954,"threshold_uncertainty_score":0.02873927,"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."}}