{"id":"W2573689326","doi":"10.1609/socs.v7i1.18410","title":"Searching for Real-Time Heuristic Search Algorithms","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Incremental heuristic search; Beam search; Null-move heuristic; Iterative deepening depth-first search; Computer science; Consistent heuristic; Heuristic; Search algorithm; Best-first search; Scheduling (production processes); Combinatorial search; Algorithm; Depth-first search; Bidirectional search; Beam stack search; Hyper-heuristic; Artificial intelligence; Mathematical optimization; 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.0008056221,0.000137722,0.0001712835,0.0001129666,0.0002570592,0.0003772425,0.001348282,0.00007443639,0.00005632277],"category_scores_gemma":[0.0003216518,0.0001202385,0.0001568461,0.0004421473,0.00007972062,0.0003487889,0.000604733,0.0002559919,0.00002118873],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002202577,"about_ca_system_score_gemma":0.0002227133,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006205737,"about_ca_topic_score_gemma":0.000001016417,"domain_scores_codex":[0.9977669,0.0000320671,0.0003139091,0.0004346283,0.001164551,0.0002879945],"domain_scores_gemma":[0.9975977,0.000358131,0.000106448,0.0001893237,0.001648606,0.00009979002],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00009459302,0.0002215645,0.0009006606,0.00005087929,0.00007968206,0.00000185554,0.0004726493,0.0007976461,0.1423037,0.8479031,0.000999998,0.006173671],"study_design_scores_gemma":[0.003284208,0.0004255545,0.00306543,0.0002625778,0.00002396308,0.00006451416,0.0001691436,0.3471582,0.5987872,0.04152809,0.004738466,0.0004926866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.649846,0.00003802398,0.04673858,0.09429593,0.02401421,0.003213827,0.0001341927,0.0007072215,0.1810121],"genre_scores_gemma":[0.9850185,0.00005845482,0.0120688,0.0001533097,0.0005521617,0.00004187631,0.00001216745,0.00002627744,0.002068451],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.806375,"threshold_uncertainty_score":0.4903184,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01607381941858719,"score_gpt":0.2721255617122246,"score_spread":0.2560517422936374,"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."}}