{"id":"W1487826456","doi":"10.1609/icaps.v23i1.13563","title":"Using Alternative Suboptimality Bounds in Heuristic Search","year":2013,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Bounding overwatch; Bounded function; Mathematical optimization; Heuristic; Upper and lower bounds; Computer science; Mathematics; Construct (python library); Constant (computer programming); Algorithm; Artificial intelligence","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.0002874412,0.0001034264,0.0001169241,0.0001784538,0.00009371468,0.0003566995,0.000490486,0.00004732997,0.00002741761],"category_scores_gemma":[0.0001337982,0.0000841885,0.00002652097,0.0002099878,0.00006691858,0.0004935691,0.0001678809,0.0002051414,0.000003273328],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006140693,"about_ca_system_score_gemma":0.00005773113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001736518,"about_ca_topic_score_gemma":0.00000120386,"domain_scores_codex":[0.9990484,0.00001307514,0.0002451078,0.0002346216,0.0003138908,0.0001449775],"domain_scores_gemma":[0.9993209,0.00005407345,0.0001518013,0.00006322659,0.0003674468,0.00004256878],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006409311,0.0001546293,0.3459557,0.0001062773,0.0001197972,0.000005604652,0.006096867,0.1497634,0.07484358,0.4158812,0.0001228347,0.006886086],"study_design_scores_gemma":[0.0001966779,0.00001640957,0.03798667,0.0002578131,0.00000199498,0.00001463918,0.0003090005,0.9554708,0.003096289,0.002562196,0.00000193978,0.00008556988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9832327,0.00001061025,0.01059161,0.001407491,0.0002063844,0.0001331912,0.000002018326,0.0001205319,0.004295411],"genre_scores_gemma":[0.9782059,0.000006044833,0.02163702,0.00008654541,0.00001611648,0.000005567767,9.215963e-7,0.00000437966,0.00003745682],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8057074,"threshold_uncertainty_score":0.3439662,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0787746973012493,"score_gpt":0.3266742291369478,"score_spread":0.2478995318356985,"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."}}