{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001265502,0.0010786,0.001083026,0.001767749,0.0005837818,0.001265765,0.00176092,0.001068928,0.004621683],"category_scores_gemma":[0.004376089,0.0007867268,0.0008805483,0.001733557,0.00114487,0.001712279,0.001037033,0.0014117,0.0006898242],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001167413,"about_ca_system_score_gemma":0.002573338,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002942555,"about_ca_topic_score_gemma":0.004315587,"domain_scores_codex":[0.9985232,0.0003324891,0.00006924936,0.0001746966,0.000729816,0.0001706068],"domain_scores_gemma":[0.9987715,0.000637279,0.0001248023,0.0001807477,0.0002344119,0.00005125725],"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.00009692303,0.0001065763,0.0003391374,0.0002736666,0.0000618136,0.00007533386,0.00005334935,0.7292076,0.003513966,0.09256049,0.003453978,0.1702572],"study_design_scores_gemma":[0.00003943692,0.00004409151,0.00005476889,0.00002539628,0.00001573871,0.00004651687,0.00001635472,0.9576858,0.0016696,0.03613894,0.004249289,0.00001415888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003984852,0.0006841797,0.9903265,0.0001278308,0.00005986965,0.00004189164,0.00002303609,0.0003069537,0.004444902],"genre_scores_gemma":[0.105811,0.000610251,0.8912986,0.000117557,0.00007129442,0.0001324444,0.00007890519,0.0001259981,0.001753935],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004621683,"threshold_uncertainty_score":0.01546109,"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."}}