{"id":"W1971185099","doi":"10.1109/iccd.2010.5647750","title":"Combined optimal and heuristic approaches for multiple constant multiplication","year":2010,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Heuristics; Pruning; Constant (computer programming); Computer science; Heuristic; Multiplication (music); Focus (optics); Mathematical optimization; Reuse; Bounded function; Algorithm; Adder; Mathematics","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.0002323108,0.00007889527,0.0001089466,0.00002516476,0.00009423316,0.0001002535,0.0002279418,0.00003904535,0.000003312],"category_scores_gemma":[0.0002319557,0.0000602998,0.00002719254,0.00008496002,0.00007275685,0.0001358604,0.0000957462,0.00008218604,0.000003180944],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003198003,"about_ca_system_score_gemma":0.00001348381,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009868785,"about_ca_topic_score_gemma":0.000001860546,"domain_scores_codex":[0.9993642,0.00001973699,0.0001223885,0.0002750982,0.00006800328,0.0001505929],"domain_scores_gemma":[0.9991037,0.0004714935,0.00003997031,0.000248924,0.00004440588,0.00009150863],"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.00001345462,0.0001154806,0.000902722,0.00001476917,0.000008293637,6.278691e-7,0.0001109696,0.00001443615,0.01153922,0.3976195,0.00009274074,0.5895678],"study_design_scores_gemma":[0.0005943287,0.00009027674,0.002045744,0.000001445539,0.000002773164,0.000004595698,0.00001664791,0.9819235,0.003437069,0.009993074,0.001775806,0.0001147991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01470504,0.000009974912,0.9835315,0.0007724881,0.0001753825,0.0002906302,0.000003288143,0.00009876893,0.0004129215],"genre_scores_gemma":[0.3769132,9.447754e-7,0.6228942,0.00005799641,0.00002252171,0.00004046559,0.00000124115,0.000003198319,0.00006623931],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.981909,"threshold_uncertainty_score":0.2458954,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04321531096769199,"score_gpt":0.2766008923768628,"score_spread":0.2333855814091708,"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."}}