{"id":"W2574105631","doi":"","title":"Heuristic subset selection in classical planning","year":2016,"lang":"en","type":"article","venue":"ResearchSpace (University of Auckland)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta; University of Regina","funders":"","keywords":"Heuristics; Heuristic; Mathematical optimization; Computer science; Selection (genetic algorithm); Greedy algorithm; Incremental heuristic search; Tree (set theory); Greedy randomized adaptive search procedure; Artificial intelligence; Machine learning; Mathematics; Beam search; Search algorithm","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.002190306,0.001074864,0.001295959,0.001469671,0.0007547041,0.001268292,0.001166283,0.0007920246,0.002671723],"category_scores_gemma":[0.004961739,0.0007477649,0.0008028865,0.00157342,0.001513496,0.001730213,0.001274494,0.0009875022,0.0005961802],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001157366,"about_ca_system_score_gemma":0.001658487,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003265872,"about_ca_topic_score_gemma":0.004121973,"domain_scores_codex":[0.9985202,0.0007463354,0.00006657936,0.0001811607,0.0003914225,0.0000943492],"domain_scores_gemma":[0.9978947,0.001583064,0.00009986199,0.0002189022,0.0001406669,0.00006299406],"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.0002046451,0.00008928552,0.000829762,0.0002576628,0.00009195718,0.0001081922,0.0001614188,0.7446112,0.001885323,0.05662518,0.003342293,0.1917931],"study_design_scores_gemma":[0.00003898346,0.00009898156,0.0001612061,0.00005253378,0.00003443548,0.00004500417,0.00004284077,0.9347351,0.001713004,0.05916474,0.003897898,0.0000152896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02165626,0.001437752,0.9692923,0.0002620678,0.00005070542,0.0001488796,0.00009895509,0.0007153911,0.006337579],"genre_scores_gemma":[0.3886946,0.001226225,0.6053855,0.0002328753,0.00008571125,0.0006023789,0.0003183582,0.0002335115,0.003220845],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003265872,"threshold_uncertainty_score":0.01158357,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02519702592548123,"score_gpt":0.2496623941802293,"score_spread":0.2244653682547481,"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."}}