{"id":"W4281701211","doi":"10.1145/3543516.3456271","title":"Competitive Algorithms for the Online Multiple Knapsack Problem with Application to Electric Vehicle Charging","year":2021,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Division of Electrical, Communications and Cyber Systems; University of Toronto; National Science Foundation","keywords":"Knapsack problem; Competitive analysis; Continuous knapsack problem; Online algorithm; Computer science; Algorithm; Mathematical optimization; Limiting; Identification (biology); Dual (grammatical number); Generalized assignment problem; Change-making problem; Optimization problem; Mathematics; Upper and lower bounds; Engineering","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00268228,0.000160074,0.0002474514,0.0002109812,0.0003603584,0.0001484682,0.0009256132,0.00003772136,0.00003228294],"category_scores_gemma":[0.00162393,0.0001167574,0.00006343327,0.005827301,0.00001700995,0.0004796544,0.000196694,0.0001687245,0.00006798602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001512593,"about_ca_system_score_gemma":0.0003992309,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000415765,"about_ca_topic_score_gemma":0.00001126036,"domain_scores_codex":[0.9976686,0.0001695816,0.0004155663,0.0004983765,0.0009198174,0.0003280518],"domain_scores_gemma":[0.9956572,0.0007971794,0.000214836,0.000959466,0.002267447,0.0001038372],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005491278,0.0001100849,0.0003875137,0.0004330236,0.0000274754,2.549424e-7,0.0001286542,0.01683026,0.0001972575,0.002695631,0.0006389644,0.9785454],"study_design_scores_gemma":[0.0006079041,0.0001719712,0.00241433,0.0004162588,0.00005010957,0.000006375015,0.00001734691,0.9437141,0.0007022726,0.00007310065,0.05164292,0.0001832769],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007615943,0.02220086,0.9582794,0.01363127,0.00007776618,0.004720245,0.000007755304,0.00009487707,0.0002262696],"genre_scores_gemma":[0.1155373,0.1066489,0.7548313,0.01632221,0.0002448401,0.005495517,0.0004578743,0.00006305026,0.0003989861],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9783621,"threshold_uncertainty_score":0.476123,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06932257938094619,"score_gpt":0.3470856595915804,"score_spread":0.2777630802106342,"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."}}