{"id":"W112839659","doi":"","title":"Memory-Bounded D* Lite","year":2008,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"","keywords":"Pathfinding; Bounded function; Computer science; Queue; Priority queue; Path (computing); Parallel computing; Theoretical computer science; Algorithm; Shortest path problem; Operating system; Mathematics; Computer network; Graph","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.001224097,0.001147424,0.001021604,0.001580458,0.001061198,0.002139658,0.003468997,0.001371553,0.01951395],"category_scores_gemma":[0.007477912,0.0006711397,0.001311925,0.002288493,0.0009386489,0.003622405,0.005134196,0.001642428,0.005597418],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006526949,"about_ca_system_score_gemma":0.001813101,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002852084,"about_ca_topic_score_gemma":0.005292169,"domain_scores_codex":[0.998817,0.000273138,0.000145208,0.0002679327,0.0003383055,0.00015843],"domain_scores_gemma":[0.996708,0.001623991,0.0001750218,0.0008771627,0.0005071441,0.0001086829],"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.00076339,0.0003076665,0.001310708,0.001071849,0.0001076826,0.0002332459,0.0003652577,0.05465237,0.01104892,0.06361368,0.04691421,0.819611],"study_design_scores_gemma":[0.0004475107,0.0007650554,0.0007730586,0.0002787179,0.0001410534,0.001035311,0.0005181264,0.675288,0.02769044,0.1646284,0.1282857,0.000148625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01065056,0.0008927702,0.9666171,0.0005057085,0.0001274327,0.0002244303,0.0008179725,0.007770753,0.01239316],"genre_scores_gemma":[0.09602927,0.0005138897,0.889873,0.000531476,0.00004197117,0.0005434796,0.001835606,0.001008817,0.009622494],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01951395,"threshold_uncertainty_score":0.06528062,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02356485116860079,"score_gpt":0.2158187258912426,"score_spread":0.1922538747226418,"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."}}