{"id":"W142773386","doi":"10.1007/978-3-642-13059-5_56","title":"Predicting Optimal Constraint Satisfaction Methods","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Constraint satisfaction problem; Computer science; Constraint satisfaction dual problem; Constraint satisfaction; A priori and a posteriori; Variety (cybernetics); Constraint (computer-aided design); Constraint learning; Local consistency; Mathematical optimization; Backtracking; Artificial intelligence; Machine learning; Algorithm; 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.002171082,0.001167001,0.001320456,0.002501233,0.0005609775,0.001579829,0.002027848,0.001570845,0.009154524],"category_scores_gemma":[0.01692968,0.0008698442,0.001177704,0.002991799,0.000773696,0.002121371,0.0009966756,0.002188362,0.001809512],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00117253,"about_ca_system_score_gemma":0.001557614,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006987035,"about_ca_topic_score_gemma":0.01141016,"domain_scores_codex":[0.9978039,0.0006983139,0.00009722293,0.0005383525,0.000696297,0.0001660162],"domain_scores_gemma":[0.9911711,0.006670036,0.0003297418,0.0006671448,0.000952238,0.000209766],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001864611,0.0002516677,0.004916776,0.000275973,0.0001024118,0.00007395404,0.00004868919,0.6003112,0.001679953,0.02095594,0.02678436,0.3444125],"study_design_scores_gemma":[0.00000671112,0.00001619109,0.0003163785,0.00001521851,0.000005637581,0.00001276727,0.000009314092,0.988484,0.0004791001,0.009825926,0.0008236073,0.000005155713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04930802,0.003401232,0.9308017,0.001054462,0.0002611683,0.0002508526,0.002035699,0.001895304,0.01099166],"genre_scores_gemma":[0.3515326,0.001795357,0.630353,0.0003231007,0.0003104259,0.0004139364,0.006417952,0.0005474222,0.008306237],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009154524,"threshold_uncertainty_score":0.03062493,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01719898647720418,"score_gpt":0.2846491178294287,"score_spread":0.2674501313522245,"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."}}