{"id":"W2091097976","doi":"10.1068/b33118","title":"Dynamic accessibility analysis in location-based service using an incremental parallel algorithm","year":2008,"lang":"en","type":"article","venue":"Environment and Planning B Planning and Design","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"MRF Geosystems (Canada)","funders":"","keywords":"Dijkstra's algorithm; Computer science; Voronoi diagram; k-nearest neighbors algorithm; Path (computing); Shortest path problem; Pathfinding; Algorithm; Euclidean distance; Service (business); Data mining; Computer network; Artificial intelligence; 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":[],"consensus_categories":[],"category_scores_codex":[0.00060397,0.0002036975,0.000236111,0.0003171864,0.0003160104,0.0001696339,0.0003187544,0.00006299264,0.000007873223],"category_scores_gemma":[0.000007294224,0.0002019558,0.00002276716,0.0005054975,0.00006050267,0.0008428275,0.0001512198,0.0001303912,0.00000276017],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004793678,"about_ca_system_score_gemma":0.00002988852,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001655339,"about_ca_topic_score_gemma":0.000002493818,"domain_scores_codex":[0.9984719,0.0001520688,0.0002543911,0.0005980039,0.0002469944,0.0002767113],"domain_scores_gemma":[0.9993171,0.0001154302,0.0001039631,0.0003402914,0.000008670893,0.0001145393],"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.00003002238,0.0001511647,0.3658782,0.00002248236,0.00009056843,0.00022039,0.001664654,0.6258422,0.0001064545,0.00001301986,0.00003075755,0.005950022],"study_design_scores_gemma":[0.0003980678,0.00004860805,0.2214699,0.00002442135,0.00004102083,0.000007117581,0.0001244007,0.7775763,0.00002027644,0.00006085477,0.00002589904,0.0002030648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2714907,0.0004084149,0.7278418,0.00003609777,0.00002694713,0.0001263505,0.00000490065,0.00004479622,0.00002002828],"genre_scores_gemma":[0.6849612,0.00001794813,0.3147118,0.0001655513,0.0000136334,0.000008095059,0.00009771125,0.00000652908,0.00001753955],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4134705,"threshold_uncertainty_score":0.8235519,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05445833725858438,"score_gpt":0.2741563962339289,"score_spread":0.2196980589753445,"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."}}