{"id":"W1890393032","doi":"10.1109/newcas.2004.1359111","title":"A fast adaptive heuristic for FPGA placement","year":2004,"lang":"en","type":"article","venue":"The 2nd Annual IEEE Northeast Workshop on Circuits and Systems, 2004. NEWCAS 2004.","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Guelph","funders":"","keywords":"Field-programmable gate array; Computer science; Simulated annealing; Heuristic; Computation; Routing (electronic design automation); Placement; Compiler; Compile time; Parallel computing; Convergence (economics); Embedded system; Computer engineering; Algorithm; Physical design; Artificial intelligence; Circuit design","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005765245,0.0005967291,0.0006389274,0.0001854391,0.0004234083,0.0001924787,0.0003754734,0.0002635725,0.00001671209],"category_scores_gemma":[0.00002983054,0.000448745,0.0001661291,0.000322351,0.0001424592,0.0002005595,0.00002519995,0.0004379335,0.00006543215],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002464924,"about_ca_system_score_gemma":0.00007713465,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001225755,"about_ca_topic_score_gemma":0.00008670638,"domain_scores_codex":[0.9974169,0.0000895297,0.0006779446,0.0005338523,0.0004427713,0.0008390397],"domain_scores_gemma":[0.9985884,0.0002467415,0.0001384217,0.0005663969,0.0001767246,0.0002833173],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003056313,0.000479822,0.00009406762,0.0007452911,0.0006677901,0.0001244687,0.009412989,0.8551292,0.0007451864,0.007070871,0.04494499,0.08027971],"study_design_scores_gemma":[0.05661081,0.01762287,0.003909463,0.03016131,0.003716472,0.005805988,0.1756875,0.2712077,0.01407041,0.02194221,0.371578,0.02768717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1372743,0.02595139,0.7980199,0.0009346697,0.005765771,0.01017152,0.002357578,0.003505344,0.01601943],"genre_scores_gemma":[0.9965587,0.0001946269,0.00008661805,0.0001626099,0.0008933501,0.0004181162,0.00002762846,0.0001341953,0.001524193],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8592843,"threshold_uncertainty_score":0.9997965,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03304179201785912,"score_gpt":0.2513717674783745,"score_spread":0.2183299754605154,"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."}}