{"id":"W4382866853","doi":"10.1609/icaps.v33i1.27200","title":"Domain-Independent Dynamic Programming: Generic State Space Search for Combinatorial Optimization","year":2023,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Constraint programming; Computer science; Solver; Integer programming; State space; Formalism (music); Mathematical optimization; Domain (mathematical analysis); Dynamic programming; Combinatorial optimization; Theoretical computer science; Mathematics; Algorithm; Stochastic programming; Programming language","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.00205433,0.001451506,0.001017125,0.001110859,0.0005666874,0.002470883,0.002483446,0.001640567,0.005158152],"category_scores_gemma":[0.005359576,0.0008745698,0.001978728,0.002169215,0.001632333,0.002799305,0.002651821,0.003344464,0.0008165455],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001720523,"about_ca_system_score_gemma":0.003121483,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005077083,"about_ca_topic_score_gemma":0.007424579,"domain_scores_codex":[0.9984188,0.0006553555,0.00009692716,0.0002892819,0.0004111551,0.000128542],"domain_scores_gemma":[0.9980339,0.001264086,0.0001573148,0.0003280263,0.0001536013,0.00006304751],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004270742,0.00007913866,0.0003806631,0.0003003265,0.00006349826,0.0000602521,0.00009138048,0.6825181,0.00120678,0.2438719,0.004359737,0.06702553],"study_design_scores_gemma":[0.00001712781,0.00001453983,0.00002865391,0.00002797048,0.000008497509,0.00002066235,0.00001770033,0.9154052,0.0007321766,0.0780587,0.005659976,0.000008793625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001868844,0.0001784203,0.9934415,0.0002119113,0.0000240628,0.00006367478,0.0001577807,0.0004508374,0.00360303],"genre_scores_gemma":[0.09662265,0.0005954393,0.8985479,0.0002676193,0.00004180269,0.0005321818,0.000616663,0.0003774933,0.00239825],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005158152,"threshold_uncertainty_score":0.01725572,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03391730746902807,"score_gpt":0.2979461123156413,"score_spread":0.2640288048466133,"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."}}