{"id":"W1519526968","doi":"10.1007/3-540-46135-3_16","title":"Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":202,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Benchmark (surveying); Smoothing; Probabilistic logic; Computer science; Novelty; Scaling; Range (aeronautics); Algorithm; Focus (optics); Probabilistic analysis of algorithms; Mathematical optimization; Artificial intelligence; Mathematics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001585821,0.0008728473,0.00212632,0.001465714,0.0008184295,0.001028212,0.002622526,0.001101794,0.00859828],"category_scores_gemma":[0.006909313,0.0009511979,0.00110868,0.002902683,0.001171199,0.002797026,0.003240302,0.001822725,0.001505476],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001020575,"about_ca_system_score_gemma":0.001071487,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003493051,"about_ca_topic_score_gemma":0.006597093,"domain_scores_codex":[0.9990324,0.0003817259,0.00004926484,0.0001824245,0.0002588521,0.0000952419],"domain_scores_gemma":[0.997668,0.001513796,0.00009993437,0.0004901541,0.000151625,0.00007645562],"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.0004059524,0.0001649544,0.0005679187,0.0002471046,0.00007536861,0.00005236986,0.0001865459,0.525026,0.003841525,0.07616603,0.01175724,0.3815089],"study_design_scores_gemma":[0.00003285288,0.00002737753,0.00006325031,0.000005821712,0.00001163945,0.00001195343,0.00001142953,0.9633859,0.0005363791,0.0349057,0.00100167,0.00000598933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01945478,0.0005208912,0.9715344,0.0002332024,0.00005594322,0.00009483157,0.000136883,0.002639467,0.005329573],"genre_scores_gemma":[0.3857268,0.0003876356,0.6051192,0.0002431911,0.0001112041,0.000433021,0.0005350569,0.0009033846,0.006540556],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00859828,"threshold_uncertainty_score":0.02876407,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01669627243050656,"score_gpt":0.2472365281927607,"score_spread":0.2305402557622541,"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."}}