{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004726379,0.0004932471,0.000447862,0.0005874176,0.0003522375,0.0008248208,0.0006663665,0.0004448436,0.002730209],"category_scores_gemma":[0.001205792,0.0004416893,0.0002812819,0.0006995174,0.0004603215,0.0013168,0.000616323,0.0003309008,0.0002359063],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007858805,"about_ca_system_score_gemma":0.0007996392,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001657327,"about_ca_topic_score_gemma":0.002767415,"domain_scores_codex":[0.9997564,0.00008630627,0.00001121039,0.00003921906,0.0000570511,0.00004984621],"domain_scores_gemma":[0.9997501,0.0001527828,0.00003640625,0.00002541997,0.00002557609,0.000009720595],"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.000169147,0.00004396983,0.0005837287,0.0001352205,0.00001816466,0.0001284884,0.00007903624,0.8797578,0.01274975,0.03102549,0.0008471591,0.07446196],"study_design_scores_gemma":[0.00002398871,0.00006632414,0.00009966084,0.00001144659,0.00001262856,0.00003579097,0.00002959206,0.9752237,0.009666031,0.01307745,0.001746066,0.000007308417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1249122,0.0003255205,0.8666167,0.0001439516,0.00001586456,0.00006572205,0.00009540295,0.0006063044,0.0072184],"genre_scores_gemma":[0.6524146,0.0002845233,0.3435029,0.00005304714,0.000008574285,0.0001546326,0.00009895524,0.0001223196,0.003360463],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002730209,"threshold_uncertainty_score":0.009133518,"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."}}