{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007620763,0.001244978,0.001550791,0.001292326,0.001023726,0.00165213,0.00188112,0.001656968,0.004498068],"category_scores_gemma":[0.04722708,0.0007501699,0.000736966,0.001059867,0.002323872,0.004124776,0.002491887,0.002846129,0.001033585],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009829552,"about_ca_system_score_gemma":0.00341538,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001937011,"about_ca_topic_score_gemma":0.001642773,"domain_scores_codex":[0.9960891,0.001456893,0.0003359877,0.0005015858,0.001095956,0.0005204317],"domain_scores_gemma":[0.9720287,0.02019825,0.002570841,0.001589243,0.002671132,0.0009417734],"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.0005556171,0.0002009159,0.001365064,0.0005318371,0.00006747874,0.0004165406,0.000475517,0.6808717,0.01339359,0.2234145,0.004940797,0.07376651],"study_design_scores_gemma":[0.0000991117,0.0004789103,0.0004529098,0.0001643796,0.00002663722,0.0001850941,0.0001641639,0.9122575,0.007875745,0.07428967,0.003961539,0.00004429313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03064936,0.0003915303,0.957805,0.0004561259,0.000078407,0.0003007856,0.00009290696,0.0003776645,0.009848054],"genre_scores_gemma":[0.5368474,0.00069979,0.4573977,0.0004347569,0.0001064392,0.0008417275,0.0003136829,0.0003222168,0.003036359],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007620763,"threshold_uncertainty_score":0.04030293,"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."}}