{"id":"W2805939218","doi":"10.1007/978-3-319-93031-2_36","title":"A Local Search Framework for Compiling Relaxed Decision Diagrams","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal; The Scarborough Hospital; University of Toronto","funders":"","keywords":"Knapsack problem; Computer science; Heuristic; Set (abstract data type); Scheme (mathematics); Local search (optimization); Theoretical computer science; Continuous knapsack problem; Mathematical optimization; Algorithm; Artificial intelligence; Mathematics; Programming language","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005196982,0.0003030686,0.0003145107,0.0003575766,0.0001585716,0.0002179796,0.0006652171,0.0004162068,0.00008604728],"category_scores_gemma":[0.00009404658,0.0002849486,0.00008816343,0.0002940939,0.0004417828,0.0001050749,0.0001699678,0.0006426526,0.00005394202],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001801188,"about_ca_system_score_gemma":0.00008794433,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001968072,"about_ca_topic_score_gemma":0.0000264717,"domain_scores_codex":[0.9982288,0.000008117045,0.000320965,0.0005632096,0.0004419945,0.0004369552],"domain_scores_gemma":[0.9982261,0.0009502957,0.00004678906,0.0004862963,0.0001757665,0.0001147717],"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.000005744187,0.000003650552,0.000008717231,0.00004414959,0.000005079661,0.000002643897,0.0003697597,0.7359271,0.000005910618,0.001921824,0.00003415029,0.2616713],"study_design_scores_gemma":[0.0001437018,0.00007938068,0.000007348651,0.0007942375,0.000004418808,0.000006665825,1.873234e-7,0.8630177,0.0003414269,0.1333686,0.001933539,0.0003028058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007006052,0.0002950579,0.9961997,0.00005808916,0.001993205,0.0003832661,0.000007955037,0.0002132044,0.0007794146],"genre_scores_gemma":[0.1129492,0.00006899233,0.8860202,0.0002693,0.0005070341,0.000008295049,0.00001439179,0.00007284785,0.00008973825],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2613685,"threshold_uncertainty_score":0.9999602,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02456635854085802,"score_gpt":0.2707292797578114,"score_spread":0.2461629212169534,"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."}}