{"id":"W1848767610","doi":"10.1109/wts.2014.6834994","title":"Solving binary and continuous knapsack problems for radio resource allocation over High Altitude Platforms","year":2014,"lang":"en","type":"article","venue":"","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Manitoba","funders":"","keywords":"Knapsack problem; Lagrangian relaxation; Multicast; Mathematical optimization; Continuous knapsack problem; Generalized assignment problem; Greedy algorithm; Computer science; Resource allocation; Integer programming; Change-making problem; Column generation; Benchmark (surveying); Optimization problem; Mathematics; Distributed computing; Computer network","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.0001314179,0.0001434868,0.0001648005,0.00005583154,0.00007728112,0.00003645928,0.00006862251,0.00008804729,0.00001643291],"category_scores_gemma":[0.00002522613,0.0001348226,0.00002236037,0.00008794033,0.00002285305,0.0002754773,0.00002221111,0.00007548444,0.000003468567],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004713069,"about_ca_system_score_gemma":0.000003642038,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006404162,"about_ca_topic_score_gemma":0.00001536493,"domain_scores_codex":[0.9992907,0.000005049936,0.0001996697,0.0001833901,0.00008407798,0.0002371163],"domain_scores_gemma":[0.9996108,0.0001008974,0.00004093856,0.0001588089,0.00003083748,0.00005768253],"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.00001052379,0.000008081977,0.0002276666,0.00008590393,0.00001866393,1.628146e-7,0.0001131619,0.9811288,0.001919825,0.005991782,0.001856739,0.008638743],"study_design_scores_gemma":[0.0007218349,0.00006151824,0.0007772597,0.00005014095,0.00001159281,0.000002662959,0.00001992298,0.9870173,0.0007243752,0.0009747623,0.009431012,0.0002076645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1044972,0.0002227593,0.8932292,0.00004678671,0.0001210733,0.000461303,0.000002042108,0.0004408572,0.0009787529],"genre_scores_gemma":[0.9462525,0.000107859,0.05279427,0.00006459381,0.0001691471,0.00007269288,0.00007899209,0.00006232184,0.0003975877],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8417553,"threshold_uncertainty_score":0.5497904,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00504358211050494,"score_gpt":0.1886178617293555,"score_spread":0.1835742796188505,"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."}}