{"id":"W2059553661","doi":"10.1109/fpl.2009.5272520","title":"Replace: An incremental placement algorithm for field programmable gate arrays","year":2009,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Floorplan; Field-programmable gate array; Simulated annealing; Placement; Parallel computing; Process (computing); Grid; Key (lock); Algorithm; Embedded system; Circuit design; Physical design; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001661239,0.0001284763,0.0001165246,0.0000463743,0.00005168308,0.00005038162,0.0001083002,0.00007219713,0.0001205091],"category_scores_gemma":[0.000004364249,0.0001202009,0.00004426444,0.00006298474,0.000005160867,0.0001622874,0.000007562355,0.00007364149,0.000007973415],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004442233,"about_ca_system_score_gemma":0.000006113769,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001110283,"about_ca_topic_score_gemma":0.00000583319,"domain_scores_codex":[0.9993086,0.000006884637,0.0001619435,0.0001571167,0.00009572073,0.0002697524],"domain_scores_gemma":[0.9996763,0.00001518695,0.00001397652,0.0001986774,0.00002065465,0.00007520374],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002568216,0.0001224546,0.00001979342,0.00002960444,0.00003447295,0.000005062273,0.000161762,0.0004850956,0.02562243,0.0007224556,0.05159644,0.9211748],"study_design_scores_gemma":[0.0006988563,0.001852896,0.00001668076,0.00002164064,0.00001828182,0.000009302772,0.0001595839,0.3705198,0.5967087,0.001681875,0.02792144,0.0003910357],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003499682,0.00005710457,0.9802668,0.00008078929,0.00009131426,0.0007269192,0.000006395779,0.001599309,0.0136717],"genre_scores_gemma":[0.3207503,0.00005218021,0.6761547,0.0006926211,0.0002264834,0.0002663918,0.00007305961,0.00004241004,0.001741822],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9207837,"threshold_uncertainty_score":0.490165,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01225880970174837,"score_gpt":0.2528336973165053,"score_spread":0.240574887614757,"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."}}