{"id":"W2966481281","doi":"10.24963/ijcai.2019/170","title":"Conditions for Avoiding Node Re-expansions in Bounded Suboptimal Search","year":2019,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Bounded function; Node (physics); Mathematical optimization; Constant (computer programming); Quality (philosophy); Regular polygon; Computer science; Upper and lower bounds; Mathematics; Engineering","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.001143349,0.0001105999,0.0001828942,0.0003963176,0.0002071258,0.000265012,0.0007636223,0.00006496971,0.0008634728],"category_scores_gemma":[0.00034392,0.0001052579,0.00006286804,0.0008113014,0.0000449294,0.0004881644,0.0002743055,0.0002556285,0.0004963843],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009107152,"about_ca_system_score_gemma":0.0002581637,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007268925,"about_ca_topic_score_gemma":0.00002663649,"domain_scores_codex":[0.9981552,0.000164007,0.0002904557,0.0004620855,0.0004395389,0.0004887107],"domain_scores_gemma":[0.9981096,0.000849905,0.00003299476,0.0006183211,0.0002461729,0.0001430437],"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.00003796207,0.0004962452,0.005863862,0.000122027,0.00004949426,0.00002614469,0.00220218,0.07715659,0.007960909,0.8932392,0.01023191,0.002613505],"study_design_scores_gemma":[0.0007814853,0.00006156559,0.001130936,0.00001411849,0.000001426882,0.000003999891,0.0002075231,0.9935476,0.001306163,0.001893971,0.0009061697,0.0001450536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02346465,0.00001147757,0.9605917,0.00235106,0.0002362165,0.000771492,0.0000131054,0.0001238864,0.01243638],"genre_scores_gemma":[0.516275,0.00001010017,0.4755578,0.0002983098,0.00003026764,0.00008822755,0.00002591217,0.00001578874,0.007698532],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.916391,"threshold_uncertainty_score":0.9454421,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04593565137038163,"score_gpt":0.3442280730466101,"score_spread":0.2982924216762284,"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."}}