{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003340933,0.001227757,0.001037363,0.001037828,0.0006590569,0.001231353,0.001823423,0.0012274,0.002717405],"category_scores_gemma":[0.01102769,0.0007256382,0.0008617933,0.001629746,0.001571874,0.002441203,0.001879495,0.002428617,0.0006807065],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008248664,"about_ca_system_score_gemma":0.001650507,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001957377,"about_ca_topic_score_gemma":0.003055626,"domain_scores_codex":[0.9978497,0.001148134,0.00009132067,0.0002712061,0.0005238561,0.0001157091],"domain_scores_gemma":[0.9955415,0.003477487,0.0002872404,0.0002917799,0.0003120256,0.00009005854],"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.0000848925,0.0001136564,0.0007866214,0.0002498523,0.00008982867,0.0001290541,0.0001517648,0.7211623,0.002211612,0.1337293,0.003171139,0.13812],"study_design_scores_gemma":[0.0000116301,0.0000203345,0.00004287574,0.00001214118,0.000006725006,0.00002224886,0.000009258964,0.9448866,0.0007792574,0.05339215,0.0008093292,0.000007476645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001106207,0.00005151504,0.9982053,0.0000864519,0.00000599487,0.00001561153,0.00001185478,0.00007476282,0.000442243],"genre_scores_gemma":[0.09592257,0.0002788412,0.9023533,0.0001385015,0.00005260168,0.0002086608,0.0001321889,0.0001039398,0.0008092835],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003340933,"threshold_uncertainty_score":0.01766872,"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."}}