{"id":"W2110722897","doi":"10.1109/icassp.2006.1660926","title":"Transmission Scheduling for Sensor Network Lifetime Maximization: A Shortest Path Bandit Formulation","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Wireless sensor network; Scheduling (production processes); Maximization; Mathematical optimization; Shortest path problem; Computer science; Independent and identically distributed random variables; Job shop scheduling; Dynamic priority scheduling; Fading; Fair-share scheduling; Channel (broadcasting); Computer network; Mathematics; Random variable; Theoretical computer science; Quality of service; Routing (electronic design automation)","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.002794807,0.001405465,0.001596192,0.0006810254,0.0005601099,0.001818516,0.001549065,0.00196906,0.003890337],"category_scores_gemma":[0.006538001,0.0006417579,0.0006800324,0.001746337,0.001318394,0.002640676,0.001153306,0.001877394,0.0006099432],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002182323,"about_ca_system_score_gemma":0.001469392,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003269371,"about_ca_topic_score_gemma":0.00276331,"domain_scores_codex":[0.9984774,0.0007164315,0.00006250641,0.0002747776,0.0002911505,0.0001777057],"domain_scores_gemma":[0.9968342,0.002255377,0.0004644699,0.00009738798,0.0002683632,0.00008023969],"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.00005381277,0.00004073908,0.0002022587,0.0001171905,0.00003751599,0.00006965823,0.00006617948,0.9210932,0.0006568216,0.06589729,0.001520976,0.01024441],"study_design_scores_gemma":[0.0000116077,0.0000296717,0.00006634978,0.00001403727,0.00001029787,0.00001888217,0.00001671995,0.973038,0.0001960994,0.02582338,0.0007679919,0.000007077444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008349205,0.0007273582,0.9850101,0.0009636151,0.00006737393,0.00008017954,0.0001460007,0.00008342021,0.004572824],"genre_scores_gemma":[0.7663706,0.003138131,0.2124719,0.0007221971,0.0005538925,0.001028022,0.0004133884,0.0002223513,0.01507952],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003890337,"threshold_uncertainty_score":0.01583391,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06525706696555161,"score_gpt":0.3795517146559486,"score_spread":0.3142946476903969,"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."}}