{"id":"W2974812669","doi":"10.48550/arxiv.1909.07895","title":"On the Optimality of the Greedy Policy for Battery Limited Energy Harvesting Communications","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Energy harvesting; Independent and identically distributed random variables; Battery (electricity); Energy (signal processing); Throughput; Power (physics); Simple (philosophy); Process (computing); Greedy algorithm; Mathematical optimization; Computer science; Maximum power principle; Battery capacity; Mathematics; Wireless; Telecommunications; Statistics; Physics","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.003155473,0.001098285,0.001300155,0.001038381,0.0007671517,0.001968284,0.001247303,0.001574442,0.002781547],"category_scores_gemma":[0.01994091,0.0005707733,0.0004896771,0.001102712,0.002893033,0.002131548,0.001494697,0.001483615,0.0004862723],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002045442,"about_ca_system_score_gemma":0.002271173,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002511922,"about_ca_topic_score_gemma":0.001633627,"domain_scores_codex":[0.9983316,0.0007081103,0.00006558748,0.0002190987,0.0002992646,0.0003762633],"domain_scores_gemma":[0.9820538,0.01588774,0.0007394233,0.0003235933,0.0006687996,0.0003266888],"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.000573488,0.0001243506,0.001056958,0.0002778243,0.00008305664,0.0002125115,0.0002213815,0.764676,0.005243365,0.2051858,0.004564945,0.01778026],"study_design_scores_gemma":[0.00004413878,0.00008561309,0.0003059851,0.00003947032,0.00001518576,0.00006356112,0.00005511841,0.9039123,0.0007704003,0.09416264,0.0005238483,0.00002177298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.125878,0.002222883,0.8436273,0.002859559,0.0002342097,0.000108986,0.0003305644,0.000312754,0.02442579],"genre_scores_gemma":[0.9643457,0.001802056,0.0292603,0.0005043772,0.0002425192,0.0001194621,0.000153429,0.000119594,0.003452473],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003155473,"threshold_uncertainty_score":0.01668793,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08791232979078091,"score_gpt":0.1893556441090353,"score_spread":0.1014433143182544,"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."}}