{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005588767,0.0008061071,0.0006015048,0.0009503057,0.0005687377,0.0005831542,0.001180301,0.0008080674,0.003262406],"category_scores_gemma":[0.00182165,0.0004212748,0.0006122531,0.0009440126,0.0005063446,0.0006210124,0.0007126032,0.000734645,0.0007836519],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006985612,"about_ca_system_score_gemma":0.001081016,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002878085,"about_ca_topic_score_gemma":0.005180111,"domain_scores_codex":[0.999499,0.0001291441,0.00002529948,0.00009968866,0.0001781504,0.00006874796],"domain_scores_gemma":[0.9994262,0.0002926108,0.00005422438,0.00008870093,0.0001101528,0.00002809499],"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.0002170575,0.00008177631,0.0007218152,0.0001432573,0.0000661775,0.0001296469,0.0000768638,0.5490046,0.01378658,0.0112784,0.006156057,0.4183378],"study_design_scores_gemma":[0.00005052859,0.00009115205,0.0002411688,0.00001357571,0.00002010071,0.0001143734,0.00002320283,0.9850299,0.003331235,0.005814309,0.005253462,0.00001708796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01358092,0.0003797265,0.9815864,0.00009953937,0.00008350674,0.00009245249,0.0000515923,0.0009984846,0.003127387],"genre_scores_gemma":[0.2008566,0.0002871816,0.7946831,0.0001518666,0.00006392975,0.0002303403,0.0002409256,0.0002279532,0.003258119],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003262406,"threshold_uncertainty_score":0.01091379,"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."}}