{"id":"W1592201666","doi":"","title":"Using expectation maximization to find likely assignments for solving CSP's","year":2007,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Backtracking; Constraint satisfaction problem; Heuristic; Constraint satisfaction; Computer science; Probabilistic logic; Maximization; Constraint (computer-aided design); Local consistency; Variable (mathematics); Random variable; Convergence (economics); Mathematical optimization; Theoretical computer science; Algorithm; 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":[],"consensus_categories":[],"category_scores_codex":[0.0002560847,0.00007646559,0.00006490262,0.0001756407,0.000154336,0.0001313628,0.000127168,0.00004174621,0.00005491129],"category_scores_gemma":[0.00007043256,0.00008034269,0.00002976965,0.0003013879,0.000006609093,0.0005175601,0.0000383719,0.00002711799,0.0000119546],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000102014,"about_ca_system_score_gemma":0.00003699884,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001216122,"about_ca_topic_score_gemma":0.00002271532,"domain_scores_codex":[0.9992176,0.000009240334,0.0001996855,0.00022607,0.0001623405,0.0001850256],"domain_scores_gemma":[0.9995274,0.00007181353,0.00006731287,0.0001405468,0.0001136023,0.00007931022],"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.00005696903,0.0001133883,0.01175097,0.00002593448,0.00003486108,0.00000396601,0.004383816,0.1512116,0.0882019,0.0626431,0.001328703,0.6802448],"study_design_scores_gemma":[0.0004681603,0.00005677817,0.03145866,0.0000154695,0.000005477762,0.000006594902,0.000173244,0.9500206,0.01657666,0.0005741053,0.0004306983,0.0002136255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01338424,0.000002602067,0.984247,0.0002691559,0.0003660567,0.0003209596,7.129987e-7,0.0001195216,0.001289771],"genre_scores_gemma":[0.4257117,5.557326e-7,0.5736809,0.0003198067,0.00003371819,0.000005390172,0.000003791982,0.000004997793,0.0002392081],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7988089,"threshold_uncertainty_score":0.327628,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05559412058511819,"score_gpt":0.3272097459386036,"score_spread":0.2716156253534854,"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."}}