{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002561087,0.0005962225,0.0003500656,0.000579285,0.0002380024,0.0005497618,0.0008486341,0.0003184531,0.0105562],"category_scores_gemma":[0.0005280466,0.000214832,0.0002522521,0.0005793991,0.0001343538,0.0005534859,0.0003058862,0.0005441261,0.002508282],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003573938,"about_ca_system_score_gemma":0.0004733365,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001222486,"about_ca_topic_score_gemma":0.001321058,"domain_scores_codex":[0.9997188,0.00005189222,0.00001764272,0.00004093543,0.0001061109,0.00006458382],"domain_scores_gemma":[0.9998134,0.00004027908,0.0000164058,0.00004564775,0.00006495153,0.00001933316],"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.001966941,0.000381801,0.003129721,0.000607456,0.0001691705,0.0009815274,0.0001461387,0.07628066,0.1848782,0.02669339,0.03843387,0.6663312],"study_design_scores_gemma":[0.0008416212,0.002012181,0.004505714,0.0001041497,0.0001550999,0.00153231,0.00009090561,0.6836724,0.1797118,0.006281845,0.120986,0.0001061436],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1428696,0.001819709,0.7766271,0.0004209928,0.0006875814,0.0004506302,0.0006211401,0.0281132,0.04839014],"genre_scores_gemma":[0.6607843,0.0004219716,0.3260312,0.0001716068,0.00008029102,0.0002099105,0.0008903512,0.0002661876,0.01114421],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0105562,"threshold_uncertainty_score":0.03531396,"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."}}