{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002863125,0.0002649669,0.0002212969,0.0002915234,0.0002257334,0.0004944352,0.0006421501,0.0003384013,0.00134401],"category_scores_gemma":[0.001077328,0.0001928318,0.000236861,0.0003194813,0.0005274467,0.0004520919,0.0003650002,0.0005193009,0.0003652322],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000365159,"about_ca_system_score_gemma":0.0006873378,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00126135,"about_ca_topic_score_gemma":0.001679903,"domain_scores_codex":[0.9998318,0.00002435165,0.000008988989,0.0000453434,0.00006449257,0.00002506939],"domain_scores_gemma":[0.9996563,0.00009262428,0.00003792801,0.0001129475,0.00008863019,0.00001159897],"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.0003940394,0.0001329032,0.002330916,0.0002326046,0.000035509,0.0004891489,0.0005168315,0.386354,0.1379754,0.07426775,0.006090678,0.3911802],"study_design_scores_gemma":[0.00008244586,0.0002796186,0.0008974439,0.00002923965,0.00002931822,0.0003632891,0.00006673123,0.8235103,0.1269156,0.01612131,0.0316741,0.00003066791],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2024415,0.0001634848,0.7782496,0.0001465139,0.00005322858,0.000123593,0.0001225126,0.008360561,0.01033892],"genre_scores_gemma":[0.3855797,0.0001208267,0.6085111,0.0001015185,0.00001018226,0.00008530326,0.0003074142,0.001062866,0.004221046],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00134401,"threshold_uncertainty_score":0.004496098,"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."}}