{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005107064,0.0002094446,0.0002619774,0.0004322227,0.0003907251,0.0004079586,0.0005658038,0.00008180803,0.00001161928],"category_scores_gemma":[0.00009323857,0.0002133741,0.0001200234,0.0020058,0.0000762004,0.0006211253,0.0000680845,0.0001642621,0.000009680451],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009430966,"about_ca_system_score_gemma":0.0001098331,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001943392,"about_ca_topic_score_gemma":0.000001073215,"domain_scores_codex":[0.9980533,0.0001985867,0.0003968617,0.000563541,0.0003711361,0.0004165923],"domain_scores_gemma":[0.9990029,0.00003884192,0.0002887254,0.0004221881,0.0001332893,0.0001140819],"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.00001749829,0.0002013484,0.00369591,0.00006490637,0.0002613156,0.00002556455,0.001826525,0.9665734,0.004611599,0.004788195,0.001937615,0.01599611],"study_design_scores_gemma":[0.0002803098,0.00001574169,0.000618969,0.00003160018,0.0001031843,0.00001391902,0.00001030105,0.9953212,0.001950098,0.0002386681,0.001121239,0.0002947611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009851001,0.0001695906,0.9871596,0.001141078,0.00009830868,0.0001900564,6.554964e-7,0.0007099576,0.0006797604],"genre_scores_gemma":[0.6217768,0.000006103587,0.3773312,0.0007859927,0.00002722101,0.00002009896,0.000007718961,0.00001101594,0.00003385747],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6119258,"threshold_uncertainty_score":0.8701142,"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."}}