{"id":"W1594463172","doi":"10.5555/2484920.2485009","title":"Stratified tree search: a novel suboptimal heuristic search algorithm","year":2013,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Regina; University of Alberta","funders":"","keywords":"Beam search; Incremental heuristic search; Heuristics; Best-first search; Heuristic; Search algorithm; Benchmark (surveying); Algorithm; Computer science; Bidirectional search; Partition (number theory); Depth-first search; Search tree; Null-move heuristic; Iterative deepening depth-first search; Beam stack search; Tree traversal; Consistent heuristic; Mathematical optimization; Mathematics; Combinatorics","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.001560722,0.0007513453,0.0013334,0.00113713,0.0007102973,0.001078265,0.001906514,0.00145634,0.003981708],"category_scores_gemma":[0.004434727,0.0005958391,0.0009930932,0.001931928,0.0009969543,0.00174451,0.001502769,0.0009933742,0.001312533],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009888606,"about_ca_system_score_gemma":0.002906604,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004690338,"about_ca_topic_score_gemma":0.006682053,"domain_scores_codex":[0.9990878,0.0003382599,0.00006220752,0.0001374759,0.0002606605,0.0001135622],"domain_scores_gemma":[0.9987882,0.000549641,0.000117841,0.0002276499,0.0002445961,0.00007209728],"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.0003842078,0.0001310408,0.002839856,0.0002560328,0.0001475016,0.0001756241,0.0003088872,0.5932637,0.00726685,0.07762874,0.01513498,0.3024625],"study_design_scores_gemma":[0.00005566002,0.00007013196,0.0001476925,0.00002127746,0.00003244154,0.00007531412,0.00003046095,0.9716341,0.001122945,0.02285899,0.003936854,0.00001400271],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01063988,0.0003420534,0.9845213,0.0002137784,0.00005148444,0.00009317829,0.0001331524,0.0007158702,0.003289304],"genre_scores_gemma":[0.1646418,0.0003247058,0.8305668,0.0003152023,0.00004443439,0.0003234042,0.0005148455,0.0002276694,0.003041056],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004690338,"threshold_uncertainty_score":0.01332015,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04620001475153443,"score_gpt":0.2618127690073549,"score_spread":0.2156127542558205,"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."}}