{"id":"W2154865079","doi":"10.1109/iscas.2012.6271395","title":"An FPGA-based acceleration platform for auction algorithm","year":2012,"lang":"en","type":"article","venue":"","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Lethbridge; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Acceleration; Computer science; Speedup; Shortest path problem; Field-programmable gate array; Auction algorithm; Algorithm; Focus (optics); Set (abstract data type); Parallel computing; Path (computing); Hardware acceleration; Theoretical computer science; Graph; Mathematics; Embedded system; Operating system; Auction theory","routes":{"ca_aff":true,"ca_fund":true,"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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001759795,0.00007421321,0.00008861066,0.0001173216,0.000368578,0.0001465464,0.0002235305,0.00006361595,0.001489543],"category_scores_gemma":[0.0001637238,0.00005417509,0.00006463394,0.0003204716,0.00003797854,0.001419717,0.000009385685,0.00004427355,0.0004770804],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002594075,"about_ca_system_score_gemma":0.00002620113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000628404,"about_ca_topic_score_gemma":0.000005496689,"domain_scores_codex":[0.9989504,0.00003688177,0.0002934307,0.0002068479,0.0003331114,0.0001793813],"domain_scores_gemma":[0.9988441,0.0003471964,0.0001142043,0.000365956,0.000199711,0.0001288432],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003128293,0.0002493406,0.0003942811,0.000001093454,0.000004607397,2.006647e-8,0.0002064761,0.000939282,0.001918609,0.1308739,0.008703447,0.8566777],"study_design_scores_gemma":[0.0008708503,0.000206209,0.006464852,0.000002286757,0.00002258355,0.000007331469,0.002230494,0.2488164,0.1174865,0.2667889,0.3567269,0.0003766754],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02361274,0.000006542722,0.972635,0.0005633562,0.0003839621,0.0002862416,0.00001663038,0.00009997444,0.002395516],"genre_scores_gemma":[0.9453206,3.958401e-7,0.0508126,0.0004756479,0.0005581563,0.0001324533,0.00004351131,0.000007538076,0.002649085],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9218224,"threshold_uncertainty_score":0.9994232,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2125048063353385,"score_gpt":0.4495481789201916,"score_spread":0.2370433725848531,"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."}}