{"id":"W2966242139","doi":"10.24963/ijcai.2019/175","title":"Direction-Optimizing Breadth-First Search with External Memory Storage","year":2019,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Fundamental Research Funds for the Central Universities; National Science Foundation","keywords":"Heuristics; Computer science; Heuristic; Auxiliary memory; Cube (algebra); Incremental heuristic search; Graph; Search algorithm; Parallel computing; Theoretical computer science; Algorithm; Beam search; Artificial intelligence; Mathematics","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.0006447825,0.0006680294,0.0007248538,0.0006731848,0.0003923231,0.0008217801,0.0008884781,0.000694939,0.00585233],"category_scores_gemma":[0.002413363,0.0004388968,0.0007374778,0.001015726,0.000552737,0.001153061,0.001081894,0.0009581225,0.001208279],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006757192,"about_ca_system_score_gemma":0.001237953,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003236254,"about_ca_topic_score_gemma":0.00508465,"domain_scores_codex":[0.9995055,0.0001463077,0.00002932082,0.0000856445,0.0001215683,0.0001116999],"domain_scores_gemma":[0.9991918,0.000478957,0.00005466994,0.0001245022,0.0001150735,0.00003496511],"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.0003811013,0.0002897259,0.001800125,0.0004449428,0.00009037561,0.0002110826,0.0002202862,0.5601942,0.01301044,0.06160054,0.01246686,0.3492903],"study_design_scores_gemma":[0.0001140288,0.000108108,0.000201874,0.00003096945,0.00003113326,0.00006999963,0.00006992823,0.9555124,0.006404229,0.03174407,0.005694231,0.00001898409],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06856298,0.000515735,0.9049076,0.0002937274,0.00009072422,0.0001987313,0.0003406504,0.004162221,0.02092755],"genre_scores_gemma":[0.2178903,0.0001766507,0.776966,0.0001568456,0.00001826019,0.0002309863,0.0004119813,0.0006109287,0.003538092],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00585233,"threshold_uncertainty_score":0.01957804,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008246674108310384,"score_gpt":0.2120163881170462,"score_spread":0.2037697140087358,"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."}}