{"id":"W2965027281","doi":"10.24963/ijcai.2019/174","title":"Iterative Budgeted Exponential Search","year":2019,"lang":"en","type":"preprint","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Compute Canada; University of Denver","keywords":"Iterative deepening depth-first search; Search tree; Omega; Overhead (engineering); Tree (set theory); Heuristic; Mathematical optimization; Graph; Exponential function; Search algorithm; Computer science; Upper and lower bounds; Limit (mathematics); Mathematics; Branch and bound; Combinatorics; Algorithm; Discrete mathematics; Beam search; Incremental heuristic search","routes":{"ca_aff":true,"ca_fund":true,"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.003173164,0.00113653,0.00140467,0.001148075,0.000892451,0.001765317,0.003786103,0.001553713,0.008423159],"category_scores_gemma":[0.01486669,0.0007945585,0.00115941,0.002053575,0.001774978,0.003535864,0.003882772,0.003774954,0.001983282],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002084368,"about_ca_system_score_gemma":0.002976452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004584171,"about_ca_topic_score_gemma":0.007004426,"domain_scores_codex":[0.9971288,0.001007107,0.0001319674,0.0005308434,0.0008105411,0.000390785],"domain_scores_gemma":[0.9926332,0.004536086,0.0004202169,0.001370795,0.0006455845,0.0003941297],"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.0003890615,0.0002402727,0.001420511,0.0003893944,0.0001115159,0.00009649877,0.0004034929,0.5633483,0.002629818,0.1962853,0.01429311,0.2203928],"study_design_scores_gemma":[0.00006908404,0.00005885046,0.0001231307,0.00003460802,0.00002229291,0.0000559187,0.00003178874,0.9139355,0.0009752627,0.07758159,0.007098095,0.00001394637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01119572,0.0005264161,0.9699516,0.0006707866,0.00009976307,0.0001388083,0.000154333,0.0008880032,0.01637457],"genre_scores_gemma":[0.238769,0.0004831167,0.7492068,0.0005196638,0.0001112281,0.0005187275,0.0004589467,0.0004796386,0.009452908],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008423159,"threshold_uncertainty_score":0.02817822,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03086939578868878,"score_gpt":0.2753862092209154,"score_spread":0.2445168134322266,"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."}}