{"id":"W22136221","doi":"10.1111/j.1740-8709.2010.00253.x","title":"Solving constraint satisfaction sequencing problems by iterative repair","year":2001,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Backtracking; Constraint satisfaction problem; Constraint programming; Constraint satisfaction dual problem; Mathematical optimization; Constraint learning; Sequence (biology); Constraint (computer-aided design); Constraint satisfaction; Constraint logic programming; Computer science; Local consistency; Local search (optimization); Constructive; Domain (mathematical analysis); Mathematics; Artificial intelligence; Stochastic programming; Process (computing)","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.0002107398,0.0001335158,0.0001142109,0.00009601742,0.0002037189,0.0002099944,0.0001237483,0.00006108936,0.0004481186],"category_scores_gemma":[0.00003898405,0.0001262486,0.00006352096,0.0003248524,0.00005318465,0.001037203,0.00005129743,0.0001258897,0.00005369065],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001869397,"about_ca_system_score_gemma":0.0000943926,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001732041,"about_ca_topic_score_gemma":0.0001787478,"domain_scores_codex":[0.9988818,0.00006173184,0.0002671008,0.0003599012,0.0002007015,0.0002288165],"domain_scores_gemma":[0.999397,0.00006198332,0.00009320258,0.0002478478,0.0001074828,0.00009243729],"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.0000115036,0.0000726149,0.1054206,0.00004027889,0.000129417,0.00006039492,0.006130728,0.01465971,0.04410351,0.2042546,0.01601606,0.6091005],"study_design_scores_gemma":[0.0006897815,0.0001171163,0.01130577,0.00006569832,0.000009701791,0.0004299273,0.0006068614,0.9746813,0.00269524,0.002140084,0.00667614,0.0005823895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0124632,0.00003121947,0.9617414,0.0007611309,0.0002442494,0.000210089,0.0000017539,0.0008639619,0.02368294],"genre_scores_gemma":[0.8999738,0.00004733546,0.09838723,0.0005620575,0.00002739667,0.00001565448,0.000005821799,0.000007009519,0.0009737377],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9600216,"threshold_uncertainty_score":0.5148271,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01750078036490818,"score_gpt":0.2338168989270682,"score_spread":0.21631611856216,"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."}}