{"id":"W2116466593","doi":"10.1142/s0129626403001483","title":"Predicated Partial Redundancy Elimination using a Cost Analysis","year":2003,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Redundancy (engineering); Computer science; Exploit; Compiler; Partial evaluation; Probabilistic logic; Computation; Data-flow analysis; Transformation (genetics); Static analysis; Parallel computing; Theoretical computer science; Algorithm; Programming language; Data flow diagram; Artificial intelligence","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.0008364135,0.0006104015,0.0004719392,0.0009697982,0.00038287,0.0008184739,0.0006465316,0.0003604929,0.001557822],"category_scores_gemma":[0.002472739,0.000301595,0.0007754564,0.0007689638,0.000678058,0.001131833,0.0006294565,0.000671353,0.000273784],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006152174,"about_ca_system_score_gemma":0.001189584,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007752743,"about_ca_topic_score_gemma":0.0008276532,"domain_scores_codex":[0.9988883,0.0002212287,0.00004561013,0.0000717392,0.0006674523,0.000105753],"domain_scores_gemma":[0.9986169,0.0006568319,0.0001381074,0.0003097823,0.0002586556,0.00001968367],"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.0002311848,0.0001095962,0.001713908,0.0002705381,0.00007533437,0.0003994346,0.000104438,0.5127247,0.05064579,0.2210797,0.003187954,0.2094574],"study_design_scores_gemma":[0.0000149217,0.00008367032,0.0003261623,0.00001179647,0.00003533693,0.0001512849,0.00001329733,0.9278542,0.02379948,0.04460027,0.003092875,0.00001676026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03380383,0.00012195,0.961667,0.0001831056,0.00002506104,0.00007569879,0.00007716157,0.0007502222,0.003295962],"genre_scores_gemma":[0.5671341,0.0002549878,0.4293859,0.00008022515,0.00004286614,0.0001706224,0.0001693462,0.0002404885,0.002521463],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001557822,"threshold_uncertainty_score":0.005211473,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02689541465424579,"score_gpt":0.2847682013409979,"score_spread":0.2578727866867521,"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."}}