{"id":"W1963955771","doi":"10.1142/s146902680300080x","title":"MAPPING REFERENCE CODE TO IRREGULAR DSPS WITHIN THE RETARGETABLE, OPTIMIZING COMPILER COGEN(T)","year":2003,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Unreachable code; Dead code; Compiler; Parallel computing; Code generation; Programming language; Code (set theory); Object code; Redundant code; Set (abstract data type); Schedule; Abstraction; Dead code elimination; Operating system","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.0007324914,0.0001650147,0.0001815354,0.0002488962,0.0003635018,0.000274609,0.001433939,0.00005088123,0.00002856242],"category_scores_gemma":[0.00008346821,0.0001319933,0.00008646372,0.0006121424,0.000129405,0.0004848761,0.0001615567,0.0002828836,0.00005517595],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007410556,"about_ca_system_score_gemma":0.0002336329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000677687,"about_ca_topic_score_gemma":0.000002738074,"domain_scores_codex":[0.997993,0.00008774608,0.0007693459,0.0003036889,0.000665873,0.0001803485],"domain_scores_gemma":[0.9973167,0.000419993,0.0004577429,0.0002791299,0.001355859,0.000170561],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004615364,0.00009435235,0.0001036725,0.000002755152,0.00007029041,0.000003402797,0.0004838975,0.2551626,0.0001671676,0.7331163,0.0004947694,0.01029621],"study_design_scores_gemma":[0.0003286746,0.0001158515,0.002542392,0.0001132859,0.00002658428,0.001173061,0.001272362,0.1680303,0.002159324,0.5890368,0.2347197,0.0004815966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0020058,0.0004564524,0.9895613,0.006161309,0.0002452366,0.0002866886,0.00001950227,0.00003021832,0.001233535],"genre_scores_gemma":[0.6318509,0.00009693958,0.366416,0.001225762,0.0001786719,0.00007958747,0.00001272999,0.000009825909,0.0001296027],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6298451,"threshold_uncertainty_score":0.5382529,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0412803169757754,"score_gpt":0.3028998724390257,"score_spread":0.2616195554632503,"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."}}