{"id":"W1917361244","doi":"10.1109/mwscas.1989.102039","title":"Optimal allocation of multiport memories in datapath synthesis","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Guelph","funders":"","keywords":"Datapath; Computer science; Register allocation; Set (abstract data type); Heuristic; Range (aeronautics); High-level synthesis; Arithmetic; Theoretical computer science; Parallel computing; Programming language; Embedded system; Mathematics; Artificial intelligence; Engineering; Field-programmable gate array","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.0004025563,0.00006251536,0.0001078854,0.0001082973,0.00002330494,0.00002349207,0.0003386424,0.00003176336,0.00001344305],"category_scores_gemma":[0.0001930611,0.00005739393,0.0000193152,0.0002902921,0.00002177456,0.0002430823,0.00005480568,0.00003749885,0.000003596896],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001387656,"about_ca_system_score_gemma":0.00004900674,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003347141,"about_ca_topic_score_gemma":0.00000556589,"domain_scores_codex":[0.9993311,0.00005904847,0.0002091603,0.0001793137,0.0001165626,0.0001048232],"domain_scores_gemma":[0.9994369,0.00008234269,0.00006603196,0.0003346321,0.00005707273,0.00002298538],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001366016,0.000653412,0.02120602,0.00006929533,0.00003177888,0.00001601073,0.002099085,0.2592635,0.001999143,0.6721736,0.003287866,0.03918664],"study_design_scores_gemma":[0.0001846942,0.00004029675,0.002909708,0.0000356059,0.000002852626,0.000008529037,0.00005956235,0.6948717,0.2995452,0.0008722452,0.001256327,0.0002132743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009585864,0.00002384527,0.9799752,0.00006475984,0.00004182137,0.00007641517,4.023375e-7,0.0001485712,0.01008312],"genre_scores_gemma":[0.5238233,0.000009477717,0.4760484,0.00002064863,0.000001986301,0.000006502644,6.338879e-7,0.000001822368,0.00008727617],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6713014,"threshold_uncertainty_score":0.2340456,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01837863928459352,"score_gpt":0.2558231062444364,"score_spread":0.2374444669598429,"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."}}