{"id":"W2028739735","doi":"10.4028/www.scientific.net/amr.490-495.1511","title":"The Improvement of Pseudo-Boolean Satisfiability Algorithm for FPGA Routing","year":2012,"lang":"en","type":"article","venue":"Advanced materials research","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"La Cité Collégiale","funders":"","keywords":"Routing (electronic design automation); Boolean satisfiability problem; Computer science; Algorithm; Field-programmable gate array; Satisfiability; Embedded system","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.003093341,0.0001138155,0.0001906667,0.00005290282,0.0001848747,0.00004500028,0.0002429009,0.0000655957,0.00003317917],"category_scores_gemma":[0.000198893,0.00008459545,0.00003971035,0.00011875,0.00009952318,0.0001864806,0.00009004928,0.0001129213,0.000007614227],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009831202,"about_ca_system_score_gemma":0.00001558115,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002450129,"about_ca_topic_score_gemma":0.000002378206,"domain_scores_codex":[0.9984898,0.00007595196,0.0003508106,0.000133821,0.0002778409,0.0006717642],"domain_scores_gemma":[0.9989064,0.0004420782,0.00003936214,0.0003740357,0.0001643361,0.00007379098],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001080407,0.00001326956,0.0000135682,0.0000764484,0.0000106417,8.129071e-8,0.00007539093,0.00001136766,0.6727438,0.0006449891,0.0001715752,0.3262281],"study_design_scores_gemma":[0.0001798365,0.0001201559,0.0001956084,0.00002411112,0.000003222615,6.44122e-7,0.0001267202,0.0006267825,0.9925525,0.003530788,0.002544473,0.00009520222],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7461427,0.000930746,0.2468197,0.00007550637,0.001083647,0.003036106,0.0002003996,0.00050046,0.001210688],"genre_scores_gemma":[0.9729937,0.0002566007,0.02590388,0.000004432785,0.0001933246,0.0005066312,0.000008700665,0.00003879472,0.00009391131],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3261329,"threshold_uncertainty_score":0.3449702,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03568103232071959,"score_gpt":0.3483881086767109,"score_spread":0.3127070763559913,"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."}}