{"id":"W2100201259","doi":"10.1109/icm.2008.5393533","title":"Placement algorithm for multiplier-based FPGA circuits","year":2008,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Field-programmable gate array; Application-specific integrated circuit; Computer science; Routing (electronic design automation); Greedy algorithm; Pipeline (software); Multiplier (economics); Power consumption; Reduction (mathematics); Algorithm; Electronic circuit; Integer programming; Interconnection; Network routing; Power (physics); Embedded system; Mathematics; Telecommunications; Engineering","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.00005827768,0.0001126321,0.0001108753,0.00006122129,0.00005779866,0.000007924251,0.0000851557,0.00006456166,0.00009296146],"category_scores_gemma":[0.000005156539,0.0001072969,0.00005749151,0.00006193261,0.00001530401,0.00004464195,0.000005685192,0.0000515106,0.00002966968],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004550744,"about_ca_system_score_gemma":0.00001299382,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003767587,"about_ca_topic_score_gemma":0.000001059023,"domain_scores_codex":[0.9994594,0.00000397031,0.0001295124,0.000114368,0.00008860019,0.0002041108],"domain_scores_gemma":[0.9997193,0.00004308713,0.000009220091,0.0001460116,0.00002665778,0.00005577671],"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.000005487602,0.000145359,0.0001581613,0.0001128628,0.00007968354,0.00002430463,0.0002399786,0.008387797,0.02903839,0.0002183369,0.1287382,0.8328514],"study_design_scores_gemma":[0.0007896771,0.0001024108,0.0001071186,0.00001099112,0.000007615457,0.000006916197,0.00001465973,0.5744041,0.3975736,0.00007876177,0.02663565,0.0002684947],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001410251,0.00007373579,0.9891943,0.00001341706,0.00010699,0.0003786012,0.00001603013,0.001299839,0.007506814],"genre_scores_gemma":[0.7760195,0.00003545849,0.2219423,0.0001936104,0.0001236805,0.0003411351,0.00003002205,0.00005782123,0.001256529],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8325829,"threshold_uncertainty_score":0.4375442,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02650386566117851,"score_gpt":0.2279425466022554,"score_spread":0.2014386809410769,"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."}}