{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001064001,0.00034144,0.0003468711,0.0005091673,0.0006543121,0.0007218373,0.0009281663,0.0002132941,0.00003010415],"category_scores_gemma":[0.00006231408,0.000331841,0.0002964964,0.0008152897,0.00006478376,0.001571112,0.0004583039,0.0003171286,0.0002157709],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001978511,"about_ca_system_score_gemma":0.0001612569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003663263,"about_ca_topic_score_gemma":0.00003346595,"domain_scores_codex":[0.9969457,0.00003081986,0.000893291,0.0003834642,0.0006237067,0.001122971],"domain_scores_gemma":[0.9982499,0.0001851913,0.0002673493,0.0006854924,0.0003610225,0.0002510295],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003318348,0.001286149,0.02588399,0.002766175,0.0008586472,0.00003429748,0.06647747,0.008639595,0.0003491187,0.3399691,0.008375998,0.5450276],"study_design_scores_gemma":[0.005779169,0.000371401,0.003206397,0.0001113641,0.000029775,0.00006261163,0.004560903,0.9095641,0.000423361,0.002173444,0.07293808,0.0007793785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02856224,0.00001142821,0.9650773,0.0009185993,0.001075721,0.002275008,0.0003868906,0.0007825809,0.0009102509],"genre_scores_gemma":[0.8982915,0.00003809802,0.09822069,0.0007232031,0.0001191962,0.0005996209,0.001368138,0.00006736309,0.0005721296],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9009245,"threshold_uncertainty_score":0.9999133,"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."}}