{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004048122,0.001937407,0.001370152,0.00154117,0.001590196,0.002448506,0.002539871,0.001768307,0.03069264],"category_scores_gemma":[0.01885699,0.00102241,0.002796354,0.002599464,0.001823631,0.002694141,0.004028074,0.002550353,0.003022387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001328509,"about_ca_system_score_gemma":0.003471413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01170088,"about_ca_topic_score_gemma":0.0167946,"domain_scores_codex":[0.9963799,0.001522966,0.0003620311,0.0006923419,0.0007012533,0.0003414559],"domain_scores_gemma":[0.9849234,0.01220223,0.0004799796,0.0008655632,0.001355883,0.0001729936],"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.000343559,0.0004645065,0.002466003,0.001919156,0.0002175129,0.0009132439,0.002576264,0.2886645,0.002363823,0.08525805,0.01828022,0.5965331],"study_design_scores_gemma":[0.0002546167,0.0002983458,0.0006048436,0.0004119462,0.0001158795,0.0004202879,0.002635631,0.7029414,0.004005395,0.2377699,0.05045985,0.0000819383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01484667,0.0003170878,0.9648193,0.0007683121,0.0001165649,0.0009704926,0.000756291,0.001737101,0.01566816],"genre_scores_gemma":[0.07070306,0.0002386042,0.9209793,0.0001689115,0.0000328748,0.0008628311,0.001151992,0.0003351184,0.005527314],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03069264,"threshold_uncertainty_score":0.1026771,"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."}}