{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01099419,0.001780691,0.001473451,0.002769696,0.001168297,0.004804524,0.002983937,0.002322481,0.00397531],"category_scores_gemma":[0.05230232,0.001055788,0.001594395,0.002783329,0.005928267,0.005976907,0.005113819,0.004085638,0.0009451142],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003461841,"about_ca_system_score_gemma":0.003384061,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002209857,"about_ca_topic_score_gemma":0.002984209,"domain_scores_codex":[0.986196,0.006756525,0.0006463281,0.001546027,0.003928724,0.0009262894],"domain_scores_gemma":[0.9582028,0.03150754,0.001871995,0.005942522,0.001929092,0.0005460827],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00009410526,0.00007043851,0.0005408894,0.0001831518,0.00006832052,0.00006850346,0.0002967578,0.3373528,0.00133873,0.5999086,0.001700799,0.05837694],"study_design_scores_gemma":[0.00002561678,0.00005473243,0.00008004806,0.00008123028,0.00002758718,0.00004540036,0.00003564691,0.7569099,0.001596786,0.2377423,0.003379568,0.00002117237],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0050395,0.0005375164,0.9871833,0.0003628655,0.00003634464,0.00003809779,0.00001826723,0.000306587,0.006477527],"genre_scores_gemma":[0.2780109,0.0007804114,0.7169895,0.0004984492,0.0001310884,0.0003219848,0.0001040191,0.0003023393,0.002861417],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01099419,"threshold_uncertainty_score":0.0581435,"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."}}