{"id":"W1863779216","doi":"10.1007/bfb0025021","title":"Design efficient local search algorithms","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Local search (optimization); Guided Local Search; Constraint satisfaction problem; Mathematical optimization; Computer science; Constraint (computer-aided design); Satisfiability; Boolean satisfiability problem; Constraint satisfaction; Search algorithm; Iterated local search; Combinatorial optimization; Algorithm; Theoretical computer science; Mathematics; Artificial intelligence","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.001064017,0.000436839,0.0003683788,0.0009194152,0.0002806814,0.0005217016,0.002016033,0.0002950626,0.0001152126],"category_scores_gemma":[0.00003065229,0.0004142541,0.0001021263,0.0006704688,0.0008339416,0.000344268,0.0007865609,0.0007725196,0.0001585519],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005419261,"about_ca_system_score_gemma":0.0008750884,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001179574,"about_ca_topic_score_gemma":0.00001897775,"domain_scores_codex":[0.9962504,0.00005849484,0.0004576242,0.001382576,0.001205164,0.0006457233],"domain_scores_gemma":[0.9979669,0.0003883463,0.0001474218,0.0009961503,0.0002801498,0.0002210673],"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.000001440417,0.00000917228,0.000001755652,0.000003421875,0.000002438174,0.00001921456,0.0001958955,0.5035551,0.000009190662,0.003079958,0.000005141296,0.4931173],"study_design_scores_gemma":[0.0002190408,0.00008891215,0.00004490854,0.0001074188,0.000003642725,0.00009525915,1.647186e-7,0.9926246,0.0006128473,0.005227217,0.0005187296,0.0004572723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000003861331,0.0001766566,0.994561,0.0009647799,0.001243798,0.0004339632,0.000002060555,0.000220221,0.00239365],"genre_scores_gemma":[0.06109742,0.00004048882,0.9370452,0.001002476,0.0003513505,0.000006251326,0.000003353038,0.0000281527,0.000425377],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.49266,"threshold_uncertainty_score":0.9998309,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02321327440138835,"score_gpt":0.2537322108365427,"score_spread":0.2305189364351544,"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."}}