{"id":"W2101155486","doi":"10.1007/11527862_9","title":"Hierarchical Heuristic Search Revisited","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Heuristic; Key (lock); Ideal (ethics); Incremental heuristic search; Hierarchical database model; Data mining; Theoretical computer science; Search algorithm; Artificial intelligence; Algorithm; Beam search","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.001309398,0.000536416,0.0009463969,0.001230989,0.001008922,0.001570152,0.001799824,0.001288613,0.0233623],"category_scores_gemma":[0.01105017,0.0005390913,0.0007453479,0.002526504,0.002069141,0.003058237,0.001697113,0.002178117,0.001625588],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001751045,"about_ca_system_score_gemma":0.001804334,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005287269,"about_ca_topic_score_gemma":0.007968863,"domain_scores_codex":[0.999044,0.0004219571,0.00002840326,0.0001486604,0.0002448048,0.0001121863],"domain_scores_gemma":[0.9977425,0.001446336,0.0000804857,0.0004702376,0.0001804247,0.00007991436],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005094025,0.00004140264,0.0002296216,0.0001257737,0.00002902657,0.00003902188,0.0001525803,0.0370057,0.000174225,0.8693182,0.01138094,0.08145248],"study_design_scores_gemma":[0.00004322676,0.0000291723,0.0003383635,0.00007471188,0.00002866498,0.00006514522,0.00009681749,0.1466008,0.0003290949,0.8358362,0.01654463,0.00001305219],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02432403,0.006516189,0.7356799,0.004903695,0.0005706443,0.0001360665,0.0003202087,0.0006607965,0.2268885],"genre_scores_gemma":[0.5824669,0.003171968,0.3451312,0.001339598,0.0003347568,0.0002971936,0.0006117443,0.0003612901,0.06628533],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0233623,"threshold_uncertainty_score":0.07815468,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02079301094900387,"score_gpt":0.2614477346103344,"score_spread":0.2406547236613305,"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."}}