{"id":"W2089902593","doi":"10.1109/tvlsi.2008.2003004","title":"Time-Efficient Single Constant Multiplication Based on Overlapping Digit Patterns","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Multiplication (music); Adder; Constant (computer programming); Computer science; Heuristic; Algorithm; Multiplication algorithm; Arithmetic; Divide and conquer algorithms; Parallel computing; Mathematics; Combinatorics; Artificial intelligence; Binary number","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.0003428221,0.0006130002,0.000717647,0.0008788535,0.0005005088,0.0008520343,0.001199451,0.0004687488,0.005225482],"category_scores_gemma":[0.001764208,0.0003285874,0.0004578193,0.001891224,0.0004282139,0.001281059,0.0006998439,0.0004004927,0.001260704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004166833,"about_ca_system_score_gemma":0.001088123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001552035,"about_ca_topic_score_gemma":0.00250929,"domain_scores_codex":[0.9995609,0.00006383433,0.00003331,0.00009439647,0.0001710992,0.00007636254],"domain_scores_gemma":[0.9992651,0.0003238674,0.00008008518,0.000163681,0.0001318373,0.00003543882],"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.0006064627,0.0001060778,0.001033544,0.0002877254,0.0000478111,0.0002944533,0.000127054,0.1043881,0.04184648,0.02916795,0.006340611,0.8157538],"study_design_scores_gemma":[0.0002074265,0.0003334625,0.0005494303,0.0000328759,0.00003932183,0.0006308357,0.00006610689,0.8969607,0.06377476,0.02807146,0.00929404,0.00003963639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07393396,0.0003719956,0.9164175,0.0001638737,0.00008080524,0.00008559057,0.00009543684,0.002169943,0.006680801],"genre_scores_gemma":[0.2928256,0.0001670158,0.7026948,0.00006406143,0.00002868279,0.00008117624,0.00020726,0.0001162854,0.00381506],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005225482,"threshold_uncertainty_score":0.01748097,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01695558374234841,"score_gpt":0.2549822595759776,"score_spread":0.2380266758336292,"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."}}