{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003221763,0.001689759,0.001684626,0.00137494,0.0009338941,0.002223436,0.003187614,0.001405559,0.003610731],"category_scores_gemma":[0.006902616,0.001560728,0.00172741,0.002769845,0.001232423,0.001687002,0.001277639,0.002604803,0.0003490963],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002847469,"about_ca_system_score_gemma":0.004695871,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02679409,"about_ca_topic_score_gemma":0.02276356,"domain_scores_codex":[0.9979067,0.0008771346,0.00009891592,0.0003237203,0.0005390893,0.0002543465],"domain_scores_gemma":[0.9963353,0.002599605,0.0003154862,0.0001206646,0.0004670181,0.0001619879],"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.00003410233,0.00005212769,0.0001748202,0.00009277818,0.00003867718,0.0000787933,0.00006394315,0.9609923,0.0006480245,0.02478213,0.0009333146,0.01210892],"study_design_scores_gemma":[0.00001685252,0.00001743091,0.00004810878,0.00001147052,0.00001166002,0.00001177648,0.00001474165,0.9920064,0.0002392969,0.00679359,0.0008203376,0.000008404121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004456438,0.0002243092,0.9918754,0.000310999,0.00004577337,0.0001310634,0.000122128,0.0001147323,0.002719222],"genre_scores_gemma":[0.1208652,0.0006151819,0.874367,0.000201373,0.00008083988,0.0006229213,0.0002907444,0.0001705108,0.002786222],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02679409,"threshold_uncertainty_score":0.05327624,"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."}}