{"id":"W6929000334","doi":"10.4230/lipics.cp.2023.23","title":"Large Neighborhood Beam Search for Domain-Independent Dynamic Programming","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Benchmark (surveying); Solver; Scheduling (production processes); State space; Beam search; Constraint programming; Dynamic programming; State (computer science); Search algorithm","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.002498064,0.001060419,0.001411195,0.001192366,0.0006729917,0.001349028,0.001514191,0.00129385,0.005853156],"category_scores_gemma":[0.006304991,0.0008070194,0.001287885,0.001842365,0.001353215,0.001694596,0.002231223,0.002618206,0.0008864846],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001063259,"about_ca_system_score_gemma":0.001787506,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002880114,"about_ca_topic_score_gemma":0.005420937,"domain_scores_codex":[0.9983368,0.0008959514,0.00006678708,0.0002555305,0.0003328893,0.0001120415],"domain_scores_gemma":[0.9975206,0.001812525,0.0001492384,0.000210424,0.0002281497,0.00007895281],"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.0001005504,0.0001316827,0.001053752,0.0002436263,0.0001153856,0.00007627129,0.0001080485,0.8001088,0.001978405,0.09711345,0.006357608,0.09261245],"study_design_scores_gemma":[0.00002765932,0.00003426948,0.00006356437,0.00001826796,0.00001030173,0.00001519948,0.00001238017,0.9714231,0.0004177409,0.02557349,0.002396293,0.000007643033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006090059,0.0004001135,0.9891556,0.0002139614,0.00004077602,0.00008324139,0.00009158126,0.0004456167,0.003479056],"genre_scores_gemma":[0.1867806,0.0005086908,0.8074915,0.0003972118,0.00007324571,0.0007426203,0.0005913914,0.0003617608,0.00305303],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005853156,"threshold_uncertainty_score":0.01958072,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.013371875105233,"score_gpt":0.2754285214771318,"score_spread":0.2620566463718987,"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."}}