{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002108755,0.001651366,0.001502754,0.0006902158,0.0007160713,0.002290597,0.001258193,0.002093278,0.004520372],"category_scores_gemma":[0.003845854,0.0009557952,0.0009642077,0.001334485,0.001029808,0.001579977,0.001211712,0.00185635,0.0004721151],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001188919,"about_ca_system_score_gemma":0.001518775,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009366498,"about_ca_topic_score_gemma":0.006439927,"domain_scores_codex":[0.9987156,0.0005974438,0.00004652109,0.0001871627,0.0002410569,0.000212155],"domain_scores_gemma":[0.9976535,0.001783544,0.0002384934,0.00005941305,0.0001630171,0.0001020278],"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.00005410647,0.00005535777,0.0002510703,0.0001533352,0.00003388134,0.00007921705,0.00003374993,0.9768019,0.0004817465,0.01131773,0.0007574998,0.009980434],"study_design_scores_gemma":[0.00001636953,0.0000342201,0.0001262682,0.00001460726,0.000006779745,0.00001472333,0.00003952801,0.9922571,0.0002191569,0.006701619,0.0005623432,0.0000073157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02277851,0.001015481,0.9692664,0.0004803952,0.0001261187,0.0000962841,0.0001324614,0.00009739547,0.006007097],"genre_scores_gemma":[0.6163433,0.001757883,0.3696016,0.0003179568,0.0002138746,0.0005910144,0.000404648,0.000139928,0.01062978],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009366498,"threshold_uncertainty_score":0.01862401,"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."}}