{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001694781,0.0005950573,0.0006192659,0.00103415,0.0004351789,0.0008032296,0.004264054,0.0004153075,0.00006983366],"category_scores_gemma":[0.0001585535,0.0005478348,0.0001578104,0.0008483289,0.0006760287,0.0004638259,0.001548192,0.002006559,0.0002124647],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003050906,"about_ca_system_score_gemma":0.0008208828,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001994493,"about_ca_topic_score_gemma":0.00001227114,"domain_scores_codex":[0.9949681,0.00009640264,0.0006151734,0.001887633,0.001400372,0.001032349],"domain_scores_gemma":[0.9963658,0.001157933,0.0001952417,0.001694739,0.0002453519,0.0003409622],"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.000009116437,0.00002751954,0.0001318565,0.00007920182,0.00001321505,0.0003008181,0.0008507008,0.05179304,0.00005174849,0.03273126,0.0001939614,0.9138176],"study_design_scores_gemma":[0.0002910903,0.0002447739,0.0001654915,0.001102034,0.000009923241,0.0001924023,6.113196e-8,0.9079548,0.0002658668,0.07848591,0.01029717,0.0009904444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00004821344,0.001177,0.9880216,0.002085041,0.0007523613,0.0003060735,0.00000871521,0.0003025378,0.007298451],"genre_scores_gemma":[0.1200162,0.0000956175,0.8723164,0.003862327,0.001618891,0.000008118708,0.000024686,0.00006991492,0.001987927],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9128271,"threshold_uncertainty_score":0.9996973,"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."}}