{"id":"W2086335328","doi":"10.1109/scam.2011.21","title":"A Constraint Programming Approach to Conflict-Aware Optimal Scheduling of Prioritized Code Clone Refactoring","year":2011,"lang":"en","type":"article","venue":"","topic":"Software Engineering Research","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Code refactoring; Computer science; Constraint programming; Programming language; Scheduling (production processes); Mathematical optimization; Mathematics; Software; Stochastic programming","routes":{"ca_aff":true,"ca_fund":true,"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.0006020403,0.000173538,0.0002774057,0.0002180329,0.00006005855,0.00008481165,0.0009693149,0.0000842924,0.00001603323],"category_scores_gemma":[0.0003861154,0.0001653877,0.00007166753,0.0005742513,0.00007783899,0.0002427444,0.0004623454,0.0002515026,0.00001647261],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006118797,"about_ca_system_score_gemma":0.0001251029,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007031365,"about_ca_topic_score_gemma":5.039257e-7,"domain_scores_codex":[0.9981679,0.00003538622,0.000335925,0.0004790906,0.0004470799,0.0005345579],"domain_scores_gemma":[0.9986228,0.0002102696,0.00005667546,0.000613593,0.0002213164,0.0002753419],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003480395,0.002832805,0.09135272,0.001933228,0.0008603804,0.0003049297,0.08196298,0.01452158,0.06648824,0.4360211,0.0002358472,0.3031382],"study_design_scores_gemma":[0.007501389,0.002017003,0.0836841,0.001016422,0.00006421154,0.0004742747,0.004383458,0.4760554,0.4125154,0.0002169295,0.008036332,0.004035064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1288806,0.00003413074,0.8684608,0.00002135817,0.0001163563,0.0004146047,0.000001913976,0.0005492375,0.001520891],"genre_scores_gemma":[0.5070691,0.000001247274,0.492808,0.00001088666,0.00001797814,0.00003238694,6.809413e-7,0.00001093064,0.00004873994],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4615338,"threshold_uncertainty_score":0.6744316,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08039188590806653,"score_gpt":0.2941476830470133,"score_spread":0.2137557971389468,"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."}}